/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:59:45,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:59:45,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:59:45,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:59:45,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:59:45,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:59:45,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:59:45,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:59:45,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:59:45,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:59:45,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:59:45,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:59:45,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:59:45,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:59:45,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:59:45,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:59:45,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:59:45,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:59:45,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:59:45,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:59:45,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:59:45,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:59:45,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:59:45,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:59:45,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:59:45,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:59:45,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:59:45,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:59:45,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:59:45,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:59:45,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:59:45,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:59:45,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:59:45,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:59:45,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:59:45,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:59:45,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:59:45,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:59:45,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:59:45,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:59:45,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:59:45,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:59:45,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:59:45,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:59:45,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:59:45,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:59:45,266 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:59:45,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:59:45,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:59:45,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:59:45,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:59:45,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:59:45,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:59:45,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:59:45,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:59:45,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:59:45,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:59:45,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:59:45,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:59:45,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:59:45,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:59:45,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:59:45,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:59:45,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:45,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:59:45,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:59:45,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:59:45,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:59:45,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:59:45,271 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:59:45,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:59:45,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:59:45,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:59:45,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:59:45,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:59:45,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:59:45,551 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:59:45,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 21:59:45,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b6bb087/9899627149a34364876f9366c14fd4b5/FLAG91c917aac [2019-12-18 21:59:46,201 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:59:46,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 21:59:46,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b6bb087/9899627149a34364876f9366c14fd4b5/FLAG91c917aac [2019-12-18 21:59:46,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b6bb087/9899627149a34364876f9366c14fd4b5 [2019-12-18 21:59:46,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:59:46,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:59:46,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:46,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:59:46,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:59:46,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:46" (1/1) ... [2019-12-18 21:59:46,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:46, skipping insertion in model container [2019-12-18 21:59:46,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:46" (1/1) ... [2019-12-18 21:59:46,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:59:46,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:59:47,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:47,069 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:59:47,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:47,259 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:59:47,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47 WrapperNode [2019-12-18 21:59:47,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:47,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:47,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:59:47,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:59:47,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:47,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:59:47,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:59:47,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:59:47,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (1/1) ... [2019-12-18 21:59:47,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:59:47,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:59:47,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:59:47,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:59:47,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (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 21:59:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:59:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:59:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:59:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:59:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:59:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:59:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:59:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:59:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:59:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:59:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:59:47,488 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 21:59:48,490 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:48,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:48,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:48 BoogieIcfgContainer [2019-12-18 21:59:48,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:48,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:48,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:48,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:48,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:59:46" (1/3) ... [2019-12-18 21:59:48,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6c4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:48, skipping insertion in model container [2019-12-18 21:59:48,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:47" (2/3) ... [2019-12-18 21:59:48,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6c4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:48, skipping insertion in model container [2019-12-18 21:59:48,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:48" (3/3) ... [2019-12-18 21:59:48,504 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-18 21:59:48,514 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:48,515 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:48,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:48,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:48,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:48,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:48,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:48,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:48,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:48,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:48,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:48,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:48,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:48,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:48,719 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 21:59:48,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:48,878 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:48,878 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:48,930 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 21:59:49,043 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 21:59:49,156 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 21:59:49,156 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:49,187 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 21:59:49,254 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 21:59:49,256 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:53,119 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:53,243 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:53,370 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-18 21:59:53,371 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-18 21:59:53,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-18 22:00:08,681 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-18 22:00:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-18 22:00:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:00:08,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:08,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:00:08,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-18 22:00:08,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:08,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017255263] [2019-12-18 22:00:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:08,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 22:00:08,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017255263] [2019-12-18 22:00:08,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:08,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:00:08,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160748029] [2019-12-18 22:00:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:08,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:08,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:08,950 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-18 22:00:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:10,180 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-18 22:00:10,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:10,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:00:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:11,007 INFO L225 Difference]: With dead ends: 120599 [2019-12-18 22:00:11,007 INFO L226 Difference]: Without dead ends: 118034 [2019-12-18 22:00:11,009 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 22:00:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-18 22:00:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-18 22:00:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-18 22:00:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-18 22:00:22,420 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-18 22:00:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:22,421 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-18 22:00:22,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-18 22:00:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:22,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:22,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:22,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-18 22:00:22,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:22,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181099219] [2019-12-18 22:00:22,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:22,566 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 22:00:22,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181099219] [2019-12-18 22:00:22,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:22,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:22,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565887526] [2019-12-18 22:00:22,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:22,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:22,571 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-18 22:00:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:28,347 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-18 22:00:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:28,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:28,842 INFO L225 Difference]: With dead ends: 156706 [2019-12-18 22:00:28,842 INFO L226 Difference]: Without dead ends: 156706 [2019-12-18 22:00:28,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 22:00:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-18 22:00:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-18 22:00:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-18 22:00:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-18 22:00:37,763 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-18 22:00:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:37,764 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-18 22:00:37,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-18 22:00:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:37,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:37,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:37,767 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-18 22:00:37,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:37,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463541106] [2019-12-18 22:00:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:37,857 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 22:00:37,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463541106] [2019-12-18 22:00:37,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:37,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:00:37,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60978679] [2019-12-18 22:00:37,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:37,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:37,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:37,860 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-18 22:00:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:37,940 INFO L93 Difference]: Finished difference Result 12243 states and 33691 transitions. [2019-12-18 22:00:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:00:37,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:37,958 INFO L225 Difference]: With dead ends: 12243 [2019-12-18 22:00:37,958 INFO L226 Difference]: Without dead ends: 8871 [2019-12-18 22:00:37,958 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 22:00:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-12-18 22:00:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8863. [2019-12-18 22:00:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8863 states. [2019-12-18 22:00:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 22087 transitions. [2019-12-18 22:00:38,126 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 22087 transitions. Word has length 11 [2019-12-18 22:00:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:38,126 INFO L462 AbstractCegarLoop]: Abstraction has 8863 states and 22087 transitions. [2019-12-18 22:00:38,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:00:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 22087 transitions. [2019-12-18 22:00:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:00:38,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:38,131 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 22:00:38,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-18 22:00:38,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:38,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436074780] [2019-12-18 22:00:38,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:38,425 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 22:00:38,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436074780] [2019-12-18 22:00:38,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:38,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:00:38,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93571086] [2019-12-18 22:00:38,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:00:38,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:38,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:00:38,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:00:38,429 INFO L87 Difference]: Start difference. First operand 8863 states and 22087 transitions. Second operand 7 states. [2019-12-18 22:00:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:39,728 INFO L93 Difference]: Finished difference Result 10373 states and 25522 transitions. [2019-12-18 22:00:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:00:39,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 22:00:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:39,745 INFO L225 Difference]: With dead ends: 10373 [2019-12-18 22:00:39,745 INFO L226 Difference]: Without dead ends: 10373 [2019-12-18 22:00:39,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:00:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10373 states. [2019-12-18 22:00:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10373 to 10258. [2019-12-18 22:00:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2019-12-18 22:00:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 25292 transitions. [2019-12-18 22:00:39,911 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 25292 transitions. Word has length 25 [2019-12-18 22:00:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:39,912 INFO L462 AbstractCegarLoop]: Abstraction has 10258 states and 25292 transitions. [2019-12-18 22:00:39,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:00:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 25292 transitions. [2019-12-18 22:00:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 22:00:39,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:39,920 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 22:00:39,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-18 22:00:39,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:39,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894391788] [2019-12-18 22:00:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:40,154 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 22:00:40,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894391788] [2019-12-18 22:00:40,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:40,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:00:40,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503306007] [2019-12-18 22:00:40,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:00:40,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:40,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:00:40,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:00:40,157 INFO L87 Difference]: Start difference. First operand 10258 states and 25292 transitions. Second operand 8 states. [2019-12-18 22:00:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:43,276 INFO L93 Difference]: Finished difference Result 11253 states and 27362 transitions. [2019-12-18 22:00:43,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:00:43,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-18 22:00:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:43,290 INFO L225 Difference]: With dead ends: 11253 [2019-12-18 22:00:43,291 INFO L226 Difference]: Without dead ends: 11205 [2019-12-18 22:00:43,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:00:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11205 states. [2019-12-18 22:00:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11205 to 10966. [2019-12-18 22:00:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10966 states. [2019-12-18 22:00:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10966 states to 10966 states and 26799 transitions. [2019-12-18 22:00:43,486 INFO L78 Accepts]: Start accepts. Automaton has 10966 states and 26799 transitions. Word has length 38 [2019-12-18 22:00:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:43,487 INFO L462 AbstractCegarLoop]: Abstraction has 10966 states and 26799 transitions. [2019-12-18 22:00:43,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:00:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10966 states and 26799 transitions. [2019-12-18 22:00:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 22:00:43,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:43,504 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 22:00:43,504 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-18 22:00:43,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:43,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208021009] [2019-12-18 22:00:43,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:43,776 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 22:00:43,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208021009] [2019-12-18 22:00:43,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:43,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:00:43,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485607634] [2019-12-18 22:00:43,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:00:43,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:00:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:00:43,779 INFO L87 Difference]: Start difference. First operand 10966 states and 26799 transitions. Second operand 9 states. [2019-12-18 22:00:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:46,138 INFO L93 Difference]: Finished difference Result 12991 states and 31377 transitions. [2019-12-18 22:00:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:00:46,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-18 22:00:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:46,156 INFO L225 Difference]: With dead ends: 12991 [2019-12-18 22:00:46,156 INFO L226 Difference]: Without dead ends: 12991 [2019-12-18 22:00:46,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:00:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-12-18 22:00:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 11783. [2019-12-18 22:00:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-18 22:00:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-18 22:00:46,368 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-18 22:00:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:46,372 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-18 22:00:46,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:00:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-18 22:00:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 22:00:46,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:46,388 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 22:00:46,388 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-18 22:00:46,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:46,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020426816] [2019-12-18 22:00:46,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:46,506 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 22:00:46,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020426816] [2019-12-18 22:00:46,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:46,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:00:46,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781041086] [2019-12-18 22:00:46,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:00:46,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:00:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:00:46,509 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-18 22:00:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:47,460 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-18 22:00:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:00:47,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 22:00:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:47,485 INFO L225 Difference]: With dead ends: 13164 [2019-12-18 22:00:47,485 INFO L226 Difference]: Without dead ends: 13164 [2019-12-18 22:00:47,487 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 22:00:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-18 22:00:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-18 22:00:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-18 22:00:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-18 22:00:47,737 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-18 22:00:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:47,737 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-18 22:00:47,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:00:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-18 22:00:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 22:00:47,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:47,753 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 22:00:47,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:47,754 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-18 22:00:47,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:47,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802686811] [2019-12-18 22:00:47,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:47,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802686811] [2019-12-18 22:00:47,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:47,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:00:47,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834117707] [2019-12-18 22:00:47,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:00:47,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:00:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:00:47,872 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 5 states. [2019-12-18 22:00:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:48,026 INFO L93 Difference]: Finished difference Result 13183 states and 31674 transitions. [2019-12-18 22:00:48,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:00:48,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 22:00:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:48,043 INFO L225 Difference]: With dead ends: 13183 [2019-12-18 22:00:48,044 INFO L226 Difference]: Without dead ends: 12979 [2019-12-18 22:00:48,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:00:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2019-12-18 22:00:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12679. [2019-12-18 22:00:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12679 states. [2019-12-18 22:00:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 30608 transitions. [2019-12-18 22:00:48,191 INFO L78 Accepts]: Start accepts. Automaton has 12679 states and 30608 transitions. Word has length 58 [2019-12-18 22:00:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:48,191 INFO L462 AbstractCegarLoop]: Abstraction has 12679 states and 30608 transitions. [2019-12-18 22:00:48,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:00:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 12679 states and 30608 transitions. [2019-12-18 22:00:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:00:48,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:48,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:48,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash 829880521, now seen corresponding path program 1 times [2019-12-18 22:00:48,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:48,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433321309] [2019-12-18 22:00:48,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:48,307 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 22:00:48,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433321309] [2019-12-18 22:00:48,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:48,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:00:48,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565040935] [2019-12-18 22:00:48,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:00:48,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:48,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:00:48,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:00:48,309 INFO L87 Difference]: Start difference. First operand 12679 states and 30608 transitions. Second operand 5 states. [2019-12-18 22:00:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:48,364 INFO L93 Difference]: Finished difference Result 5514 states and 12816 transitions. [2019-12-18 22:00:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:48,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 22:00:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:48,372 INFO L225 Difference]: With dead ends: 5514 [2019-12-18 22:00:48,372 INFO L226 Difference]: Without dead ends: 5256 [2019-12-18 22:00:48,372 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 22:00:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2019-12-18 22:00:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5103. [2019-12-18 22:00:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-18 22:00:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11978 transitions. [2019-12-18 22:00:48,534 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11978 transitions. Word has length 64 [2019-12-18 22:00:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:48,534 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11978 transitions. [2019-12-18 22:00:48,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:00:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11978 transitions. [2019-12-18 22:00:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:00:48,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:48,541 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 22:00:48,541 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-18 22:00:48,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:48,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468873661] [2019-12-18 22:00:48,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:48,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468873661] [2019-12-18 22:00:48,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:48,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:48,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675573503] [2019-12-18 22:00:48,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:48,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:48,680 INFO L87 Difference]: Start difference. First operand 5103 states and 11978 transitions. Second operand 3 states. [2019-12-18 22:00:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:48,746 INFO L93 Difference]: Finished difference Result 5103 states and 11932 transitions. [2019-12-18 22:00:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:48,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 22:00:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:48,753 INFO L225 Difference]: With dead ends: 5103 [2019-12-18 22:00:48,754 INFO L226 Difference]: Without dead ends: 5103 [2019-12-18 22:00:48,754 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 22:00:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2019-12-18 22:00:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5091. [2019-12-18 22:00:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2019-12-18 22:00:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 11910 transitions. [2019-12-18 22:00:48,808 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 11910 transitions. Word has length 94 [2019-12-18 22:00:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:48,808 INFO L462 AbstractCegarLoop]: Abstraction has 5091 states and 11910 transitions. [2019-12-18 22:00:48,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 11910 transitions. [2019-12-18 22:00:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:00:48,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:48,815 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 22:00:48,815 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash 827084238, now seen corresponding path program 1 times [2019-12-18 22:00:48,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:48,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913061354] [2019-12-18 22:00:48,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:48,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913061354] [2019-12-18 22:00:48,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:48,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:00:48,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333907035] [2019-12-18 22:00:48,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:00:48,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:48,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:00:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:00:48,933 INFO L87 Difference]: Start difference. First operand 5091 states and 11910 transitions. Second operand 6 states. [2019-12-18 22:00:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:49,653 INFO L93 Difference]: Finished difference Result 5322 states and 12370 transitions. [2019-12-18 22:00:49,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:00:49,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 22:00:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:49,661 INFO L225 Difference]: With dead ends: 5322 [2019-12-18 22:00:49,661 INFO L226 Difference]: Without dead ends: 5322 [2019-12-18 22:00:49,661 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 22:00:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-12-18 22:00:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5103. [2019-12-18 22:00:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-18 22:00:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11932 transitions. [2019-12-18 22:00:49,717 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11932 transitions. Word has length 95 [2019-12-18 22:00:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:49,717 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11932 transitions. [2019-12-18 22:00:49,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:00:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11932 transitions. [2019-12-18 22:00:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:00:49,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:49,724 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 22:00:49,725 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -93310818, now seen corresponding path program 2 times [2019-12-18 22:00:49,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:49,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330266297] [2019-12-18 22:00:49,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:49,818 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 22:00:49,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330266297] [2019-12-18 22:00:49,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:49,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:00:49,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443980367] [2019-12-18 22:00:49,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:00:49,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:00:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:00:49,820 INFO L87 Difference]: Start difference. First operand 5103 states and 11932 transitions. Second operand 5 states. [2019-12-18 22:00:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:50,351 INFO L93 Difference]: Finished difference Result 5591 states and 12935 transitions. [2019-12-18 22:00:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:00:50,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-18 22:00:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:50,359 INFO L225 Difference]: With dead ends: 5591 [2019-12-18 22:00:50,359 INFO L226 Difference]: Without dead ends: 5591 [2019-12-18 22:00:50,359 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 22:00:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-18 22:00:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5244. [2019-12-18 22:00:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-18 22:00:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 12250 transitions. [2019-12-18 22:00:50,417 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 12250 transitions. Word has length 95 [2019-12-18 22:00:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:50,417 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 12250 transitions. [2019-12-18 22:00:50,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:00:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 12250 transitions. [2019-12-18 22:00:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:00:50,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:50,424 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 22:00:50,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash 516666554, now seen corresponding path program 3 times [2019-12-18 22:00:50,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:50,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893353485] [2019-12-18 22:00:50,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:50,553 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 22:00:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893353485] [2019-12-18 22:00:50,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:50,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:50,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111637698] [2019-12-18 22:00:50,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:50,555 INFO L87 Difference]: Start difference. First operand 5244 states and 12250 transitions. Second operand 3 states. [2019-12-18 22:00:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:50,614 INFO L93 Difference]: Finished difference Result 5244 states and 12249 transitions. [2019-12-18 22:00:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:50,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 22:00:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:50,621 INFO L225 Difference]: With dead ends: 5244 [2019-12-18 22:00:50,622 INFO L226 Difference]: Without dead ends: 5244 [2019-12-18 22:00:50,622 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 22:00:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-18 22:00:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5120. [2019-12-18 22:00:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-12-18 22:00:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 12020 transitions. [2019-12-18 22:00:50,680 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 12020 transitions. Word has length 95 [2019-12-18 22:00:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:50,680 INFO L462 AbstractCegarLoop]: Abstraction has 5120 states and 12020 transitions. [2019-12-18 22:00:50,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 12020 transitions. [2019-12-18 22:00:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:50,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:50,689 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 22:00:50,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1106579360, now seen corresponding path program 1 times [2019-12-18 22:00:50,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:50,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534633551] [2019-12-18 22:00:50,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00: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 22:00:50,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534633551] [2019-12-18 22:00:50,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:50,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:00:50,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511863720] [2019-12-18 22:00:50,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:00:50,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:00:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:00:50,864 INFO L87 Difference]: Start difference. First operand 5120 states and 12020 transitions. Second operand 10 states. [2019-12-18 22:00:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:51,893 INFO L93 Difference]: Finished difference Result 12417 states and 28314 transitions. [2019-12-18 22:00:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:00:51,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:00:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:51,907 INFO L225 Difference]: With dead ends: 12417 [2019-12-18 22:00:51,907 INFO L226 Difference]: Without dead ends: 10735 [2019-12-18 22:00:51,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:00:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2019-12-18 22:00:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 6855. [2019-12-18 22:00:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6855 states. [2019-12-18 22:00:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 16442 transitions. [2019-12-18 22:00:52,007 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 16442 transitions. Word has length 96 [2019-12-18 22:00:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:52,007 INFO L462 AbstractCegarLoop]: Abstraction has 6855 states and 16442 transitions. [2019-12-18 22:00:52,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:00:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 16442 transitions. [2019-12-18 22:00:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:52,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:52,017 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 22:00:52,017 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1106149920, now seen corresponding path program 2 times [2019-12-18 22:00:52,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:52,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106285318] [2019-12-18 22:00:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:52,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106285318] [2019-12-18 22:00:52,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:52,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:00:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76454641] [2019-12-18 22:00:52,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:00:52,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:00:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:00:52,433 INFO L87 Difference]: Start difference. First operand 6855 states and 16442 transitions. Second operand 16 states. [2019-12-18 22:00:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:54,832 INFO L93 Difference]: Finished difference Result 14219 states and 34178 transitions. [2019-12-18 22:00:54,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 22:00:54,833 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 22:00:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:54,849 INFO L225 Difference]: With dead ends: 14219 [2019-12-18 22:00:54,850 INFO L226 Difference]: Without dead ends: 13276 [2019-12-18 22:00:54,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 22:00:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13276 states. [2019-12-18 22:00:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13276 to 11470. [2019-12-18 22:00:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11470 states. [2019-12-18 22:00:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11470 states to 11470 states and 28216 transitions. [2019-12-18 22:00:54,997 INFO L78 Accepts]: Start accepts. Automaton has 11470 states and 28216 transitions. Word has length 96 [2019-12-18 22:00:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:54,997 INFO L462 AbstractCegarLoop]: Abstraction has 11470 states and 28216 transitions. [2019-12-18 22:00:54,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:00:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11470 states and 28216 transitions. [2019-12-18 22:00:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:55,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:55,010 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 22:00:55,010 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1896887712, now seen corresponding path program 3 times [2019-12-18 22:00:55,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:55,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306279339] [2019-12-18 22:00:55,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:55,143 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 22:00:55,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306279339] [2019-12-18 22:00:55,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:55,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:00:55,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865570778] [2019-12-18 22:00:55,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:00:55,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:00:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:00:55,145 INFO L87 Difference]: Start difference. First operand 11470 states and 28216 transitions. Second operand 10 states. [2019-12-18 22:00:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:55,957 INFO L93 Difference]: Finished difference Result 19021 states and 45326 transitions. [2019-12-18 22:00:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:00:55,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:00:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:55,978 INFO L225 Difference]: With dead ends: 19021 [2019-12-18 22:00:55,978 INFO L226 Difference]: Without dead ends: 16652 [2019-12-18 22:00:55,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:00:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16652 states. [2019-12-18 22:00:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16652 to 10814. [2019-12-18 22:00:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10814 states. [2019-12-18 22:00:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10814 states to 10814 states and 26600 transitions. [2019-12-18 22:00:56,141 INFO L78 Accepts]: Start accepts. Automaton has 10814 states and 26600 transitions. Word has length 96 [2019-12-18 22:00:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:56,142 INFO L462 AbstractCegarLoop]: Abstraction has 10814 states and 26600 transitions. [2019-12-18 22:00:56,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:00:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10814 states and 26600 transitions. [2019-12-18 22:00:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:56,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:56,156 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 22:00:56,156 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash 788010666, now seen corresponding path program 4 times [2019-12-18 22:00:56,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:56,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876305826] [2019-12-18 22:00:56,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:56,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 22:00:56,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876305826] [2019-12-18 22:00:56,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:56,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:00:56,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453253326] [2019-12-18 22:00:56,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:00:56,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:00:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:00:56,320 INFO L87 Difference]: Start difference. First operand 10814 states and 26600 transitions. Second operand 10 states. [2019-12-18 22:00:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:58,184 INFO L93 Difference]: Finished difference Result 17013 states and 41476 transitions. [2019-12-18 22:00:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:00:58,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:00:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:58,207 INFO L225 Difference]: With dead ends: 17013 [2019-12-18 22:00:58,207 INFO L226 Difference]: Without dead ends: 17013 [2019-12-18 22:00:58,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:00:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17013 states. [2019-12-18 22:00:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17013 to 14334. [2019-12-18 22:00:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14334 states. [2019-12-18 22:00:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14334 states to 14334 states and 35381 transitions. [2019-12-18 22:00:58,400 INFO L78 Accepts]: Start accepts. Automaton has 14334 states and 35381 transitions. Word has length 96 [2019-12-18 22:00:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:58,400 INFO L462 AbstractCegarLoop]: Abstraction has 14334 states and 35381 transitions. [2019-12-18 22:00:58,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:00:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14334 states and 35381 transitions. [2019-12-18 22:00:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:58,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:58,415 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 22:00:58,415 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2008375454, now seen corresponding path program 5 times [2019-12-18 22:00:58,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:58,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121472687] [2019-12-18 22:00:58,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:58,579 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 22:00:58,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121472687] [2019-12-18 22:00:58,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:58,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:00:58,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687307991] [2019-12-18 22:00:58,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:00:58,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:00:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:00:58,581 INFO L87 Difference]: Start difference. First operand 14334 states and 35381 transitions. Second operand 10 states. [2019-12-18 22:00:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:59,466 INFO L93 Difference]: Finished difference Result 22414 states and 54461 transitions. [2019-12-18 22:00:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:00:59,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:00:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:59,492 INFO L225 Difference]: With dead ends: 22414 [2019-12-18 22:00:59,492 INFO L226 Difference]: Without dead ends: 21284 [2019-12-18 22:00:59,492 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 22:00:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21284 states. [2019-12-18 22:00:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21284 to 17029. [2019-12-18 22:00:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17029 states. [2019-12-18 22:00:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 42617 transitions. [2019-12-18 22:00:59,729 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 42617 transitions. Word has length 96 [2019-12-18 22:00:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:59,730 INFO L462 AbstractCegarLoop]: Abstraction has 17029 states and 42617 transitions. [2019-12-18 22:00:59,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:00:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 42617 transitions. [2019-12-18 22:00:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:00:59,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:59,754 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 22:00:59,754 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -33693212, now seen corresponding path program 6 times [2019-12-18 22:00:59,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:59,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495517752] [2019-12-18 22:00:59,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:59,915 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 22:00:59,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495517752] [2019-12-18 22:00:59,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:00:59,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85893056] [2019-12-18 22:00:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:00:59,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:00:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:00:59,917 INFO L87 Difference]: Start difference. First operand 17029 states and 42617 transitions. Second operand 10 states. [2019-12-18 22:01:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:00,543 INFO L93 Difference]: Finished difference Result 30276 states and 76108 transitions. [2019-12-18 22:01:00,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:01:00,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:01:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:00,579 INFO L225 Difference]: With dead ends: 30276 [2019-12-18 22:01:00,579 INFO L226 Difference]: Without dead ends: 26109 [2019-12-18 22:01:00,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:01:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26109 states. [2019-12-18 22:01:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26109 to 20371. [2019-12-18 22:01:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-12-18 22:01:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 51483 transitions. [2019-12-18 22:01:00,964 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 51483 transitions. Word has length 96 [2019-12-18 22:01:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:00,964 INFO L462 AbstractCegarLoop]: Abstraction has 20371 states and 51483 transitions. [2019-12-18 22:01:00,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 51483 transitions. [2019-12-18 22:01:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:01:00,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:00,995 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 22:01:00,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash -797383456, now seen corresponding path program 7 times [2019-12-18 22:01:00,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:00,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232657033] [2019-12-18 22:01:00,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:01,120 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 22:01:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232657033] [2019-12-18 22:01:01,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:01,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826306640] [2019-12-18 22:01:01,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:01,123 INFO L87 Difference]: Start difference. First operand 20371 states and 51483 transitions. Second operand 5 states. [2019-12-18 22:01:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:01,326 INFO L93 Difference]: Finished difference Result 20069 states and 50698 transitions. [2019-12-18 22:01:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:01:01,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 22:01:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:01,363 INFO L225 Difference]: With dead ends: 20069 [2019-12-18 22:01:01,363 INFO L226 Difference]: Without dead ends: 20069 [2019-12-18 22:01:01,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 22:01:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20069 states. [2019-12-18 22:01:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20069 to 15955. [2019-12-18 22:01:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15955 states. [2019-12-18 22:01:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15955 states to 15955 states and 39668 transitions. [2019-12-18 22:01:01,637 INFO L78 Accepts]: Start accepts. Automaton has 15955 states and 39668 transitions. Word has length 96 [2019-12-18 22:01:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:01,637 INFO L462 AbstractCegarLoop]: Abstraction has 15955 states and 39668 transitions. [2019-12-18 22:01:01,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 15955 states and 39668 transitions. [2019-12-18 22:01:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:01,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:01,653 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 22:01:01,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 1 times [2019-12-18 22:01:01,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:01,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164996825] [2019-12-18 22:01:01,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:02,839 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 22:01:02,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164996825] [2019-12-18 22:01:02,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:02,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 22:01:02,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221061066] [2019-12-18 22:01:02,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 22:01:02,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:02,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 22:01:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:01:02,841 INFO L87 Difference]: Start difference. First operand 15955 states and 39668 transitions. Second operand 24 states. [2019-12-18 22:01:03,036 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-12-18 22:01:03,173 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-18 22:01:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:11,714 INFO L93 Difference]: Finished difference Result 20753 states and 50946 transitions. [2019-12-18 22:01:11,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 22:01:11,716 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-18 22:01:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:11,737 INFO L225 Difference]: With dead ends: 20753 [2019-12-18 22:01:11,737 INFO L226 Difference]: Without dead ends: 19122 [2019-12-18 22:01:11,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=691, Invalid=4565, Unknown=0, NotChecked=0, Total=5256 [2019-12-18 22:01:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19122 states. [2019-12-18 22:01:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19122 to 18155. [2019-12-18 22:01:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18155 states. [2019-12-18 22:01:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18155 states to 18155 states and 45196 transitions. [2019-12-18 22:01:11,945 INFO L78 Accepts]: Start accepts. Automaton has 18155 states and 45196 transitions. Word has length 97 [2019-12-18 22:01:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:11,945 INFO L462 AbstractCegarLoop]: Abstraction has 18155 states and 45196 transitions. [2019-12-18 22:01:11,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 22:01:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 18155 states and 45196 transitions. [2019-12-18 22:01:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:11,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:11,964 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 22:01:11,964 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1804476961, now seen corresponding path program 2 times [2019-12-18 22:01:11,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:11,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573319553] [2019-12-18 22:01:11,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:12,824 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 22:01:12,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573319553] [2019-12-18 22:01:12,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:12,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-18 22:01:12,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257856585] [2019-12-18 22:01:12,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 22:01:12,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 22:01:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:01:12,827 INFO L87 Difference]: Start difference. First operand 18155 states and 45196 transitions. Second operand 26 states. [2019-12-18 22:01:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:34,588 INFO L93 Difference]: Finished difference Result 59459 states and 149033 transitions. [2019-12-18 22:01:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-12-18 22:01:34,589 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2019-12-18 22:01:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:34,658 INFO L225 Difference]: With dead ends: 59459 [2019-12-18 22:01:34,658 INFO L226 Difference]: Without dead ends: 57551 [2019-12-18 22:01:34,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8014 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1750, Invalid=20900, Unknown=0, NotChecked=0, Total=22650 [2019-12-18 22:01:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57551 states. [2019-12-18 22:01:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57551 to 40170. [2019-12-18 22:01:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40170 states. [2019-12-18 22:01:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40170 states to 40170 states and 102857 transitions. [2019-12-18 22:01:35,425 INFO L78 Accepts]: Start accepts. Automaton has 40170 states and 102857 transitions. Word has length 97 [2019-12-18 22:01:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:35,425 INFO L462 AbstractCegarLoop]: Abstraction has 40170 states and 102857 transitions. [2019-12-18 22:01:35,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 22:01:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40170 states and 102857 transitions. [2019-12-18 22:01:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:35,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:35,470 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 22:01:35,470 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:35,471 INFO L82 PathProgramCache]: Analyzing trace with hash -142909797, now seen corresponding path program 3 times [2019-12-18 22:01:35,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:35,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889727936] [2019-12-18 22:01:35,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:35,782 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 22:01:35,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889727936] [2019-12-18 22:01:35,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:35,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:01:35,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880449136] [2019-12-18 22:01:35,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:01:35,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:35,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:01:35,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:01:35,784 INFO L87 Difference]: Start difference. First operand 40170 states and 102857 transitions. Second operand 12 states. [2019-12-18 22:01:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:37,639 INFO L93 Difference]: Finished difference Result 44375 states and 112661 transitions. [2019-12-18 22:01:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:01:37,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 22:01:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:37,693 INFO L225 Difference]: With dead ends: 44375 [2019-12-18 22:01:37,693 INFO L226 Difference]: Without dead ends: 44333 [2019-12-18 22:01:37,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:01:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44333 states. [2019-12-18 22:01:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44333 to 42272. [2019-12-18 22:01:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42272 states. [2019-12-18 22:01:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42272 states to 42272 states and 107995 transitions. [2019-12-18 22:01:38,240 INFO L78 Accepts]: Start accepts. Automaton has 42272 states and 107995 transitions. Word has length 97 [2019-12-18 22:01:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:38,240 INFO L462 AbstractCegarLoop]: Abstraction has 42272 states and 107995 transitions. [2019-12-18 22:01:38,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:01:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 42272 states and 107995 transitions. [2019-12-18 22:01:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:38,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:38,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:38,281 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1930591181, now seen corresponding path program 4 times [2019-12-18 22:01:38,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:38,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734416457] [2019-12-18 22:01:38,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:38,569 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 22:01:38,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734416457] [2019-12-18 22:01:38,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:01:38,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696181720] [2019-12-18 22:01:38,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:01:38,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:01:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:01:38,575 INFO L87 Difference]: Start difference. First operand 42272 states and 107995 transitions. Second operand 12 states. [2019-12-18 22:01:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:40,024 INFO L93 Difference]: Finished difference Result 45042 states and 114256 transitions. [2019-12-18 22:01:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:01:40,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 22:01:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:40,078 INFO L225 Difference]: With dead ends: 45042 [2019-12-18 22:01:40,078 INFO L226 Difference]: Without dead ends: 45042 [2019-12-18 22:01:40,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:01:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45042 states. [2019-12-18 22:01:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45042 to 42312. [2019-12-18 22:01:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42312 states. [2019-12-18 22:01:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42312 states to 42312 states and 108082 transitions. [2019-12-18 22:01:40,951 INFO L78 Accepts]: Start accepts. Automaton has 42312 states and 108082 transitions. Word has length 97 [2019-12-18 22:01:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:40,951 INFO L462 AbstractCegarLoop]: Abstraction has 42312 states and 108082 transitions. [2019-12-18 22:01:40,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:01:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42312 states and 108082 transitions. [2019-12-18 22:01:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:40,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:40,992 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 22:01:40,992 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:40,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1750882225, now seen corresponding path program 5 times [2019-12-18 22:01:40,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:40,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776911857] [2019-12-18 22:01:40,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:41,139 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 22:01:41,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776911857] [2019-12-18 22:01:41,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:41,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:01:41,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456659564] [2019-12-18 22:01:41,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:01:41,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:01:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:01:41,142 INFO L87 Difference]: Start difference. First operand 42312 states and 108082 transitions. Second operand 7 states. [2019-12-18 22:01:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:42,142 INFO L93 Difference]: Finished difference Result 51436 states and 130576 transitions. [2019-12-18 22:01:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:01:42,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:01:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:42,211 INFO L225 Difference]: With dead ends: 51436 [2019-12-18 22:01:42,211 INFO L226 Difference]: Without dead ends: 51436 [2019-12-18 22:01:42,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 6 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 22:01:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51436 states. [2019-12-18 22:01:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51436 to 44356. [2019-12-18 22:01:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44356 states. [2019-12-18 22:01:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44356 states to 44356 states and 113377 transitions. [2019-12-18 22:01:42,807 INFO L78 Accepts]: Start accepts. Automaton has 44356 states and 113377 transitions. Word has length 97 [2019-12-18 22:01:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:42,807 INFO L462 AbstractCegarLoop]: Abstraction has 44356 states and 113377 transitions. [2019-12-18 22:01:42,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:01:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 44356 states and 113377 transitions. [2019-12-18 22:01:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:42,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:42,851 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 22:01:42,851 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1167481557, now seen corresponding path program 6 times [2019-12-18 22:01:42,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:42,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925948682] [2019-12-18 22:01:42,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:01:43,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925948682] [2019-12-18 22:01:43,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:43,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 22:01:43,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427872851] [2019-12-18 22:01:43,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 22:01:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 22:01:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:01:43,390 INFO L87 Difference]: Start difference. First operand 44356 states and 113377 transitions. Second operand 22 states. [2019-12-18 22:01:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:54,396 INFO L93 Difference]: Finished difference Result 83748 states and 212726 transitions. [2019-12-18 22:01:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-18 22:01:54,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2019-12-18 22:01:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:54,492 INFO L225 Difference]: With dead ends: 83748 [2019-12-18 22:01:54,493 INFO L226 Difference]: Without dead ends: 77542 [2019-12-18 22:01:54,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=820, Invalid=7012, Unknown=0, NotChecked=0, Total=7832 [2019-12-18 22:01:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77542 states. [2019-12-18 22:01:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77542 to 52157. [2019-12-18 22:01:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52157 states. [2019-12-18 22:01:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52157 states to 52157 states and 134111 transitions. [2019-12-18 22:01:55,302 INFO L78 Accepts]: Start accepts. Automaton has 52157 states and 134111 transitions. Word has length 97 [2019-12-18 22:01:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:55,302 INFO L462 AbstractCegarLoop]: Abstraction has 52157 states and 134111 transitions. [2019-12-18 22:01:55,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 22:01:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52157 states and 134111 transitions. [2019-12-18 22:01:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:55,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:55,359 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 22:01:55,359 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1808625369, now seen corresponding path program 7 times [2019-12-18 22:01:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:55,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841734762] [2019-12-18 22:01:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:55,619 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 22:01:55,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841734762] [2019-12-18 22:01:55,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:55,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:01:55,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053199408] [2019-12-18 22:01:55,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:01:55,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:01:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:01:55,622 INFO L87 Difference]: Start difference. First operand 52157 states and 134111 transitions. Second operand 10 states. [2019-12-18 22:01:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:57,198 INFO L93 Difference]: Finished difference Result 55250 states and 141322 transitions. [2019-12-18 22:01:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:01:57,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:01:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:57,272 INFO L225 Difference]: With dead ends: 55250 [2019-12-18 22:01:57,272 INFO L226 Difference]: Without dead ends: 55030 [2019-12-18 22:01:57,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:01:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55030 states. [2019-12-18 22:01:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55030 to 53602. [2019-12-18 22:01:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53602 states. [2019-12-18 22:01:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53602 states to 53602 states and 137636 transitions. [2019-12-18 22:01:58,170 INFO L78 Accepts]: Start accepts. Automaton has 53602 states and 137636 transitions. Word has length 97 [2019-12-18 22:01:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:58,171 INFO L462 AbstractCegarLoop]: Abstraction has 53602 states and 137636 transitions. [2019-12-18 22:01:58,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:01:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 53602 states and 137636 transitions. [2019-12-18 22:01:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:01:58,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:58,225 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 22:01:58,225 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash 459587245, now seen corresponding path program 8 times [2019-12-18 22:01:58,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:58,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424750558] [2019-12-18 22:01:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:58,848 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 22:01:58,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424750558] [2019-12-18 22:01:58,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:58,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 22:01:58,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182171247] [2019-12-18 22:01:58,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 22:01:58,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 22:01:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:01:58,850 INFO L87 Difference]: Start difference. First operand 53602 states and 137636 transitions. Second operand 21 states. [2019-12-18 22:02:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:02,957 INFO L93 Difference]: Finished difference Result 82120 states and 210663 transitions. [2019-12-18 22:02:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 22:02:02,958 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2019-12-18 22:02:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:03,063 INFO L225 Difference]: With dead ends: 82120 [2019-12-18 22:02:03,063 INFO L226 Difference]: Without dead ends: 81416 [2019-12-18 22:02:03,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 22:02:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81416 states. [2019-12-18 22:02:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81416 to 66193. [2019-12-18 22:02:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66193 states. [2019-12-18 22:02:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66193 states to 66193 states and 171564 transitions. [2019-12-18 22:02:04,647 INFO L78 Accepts]: Start accepts. Automaton has 66193 states and 171564 transitions. Word has length 97 [2019-12-18 22:02:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:04,647 INFO L462 AbstractCegarLoop]: Abstraction has 66193 states and 171564 transitions. [2019-12-18 22:02:04,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 22:02:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66193 states and 171564 transitions. [2019-12-18 22:02:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:04,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:04,713 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 22:02:04,713 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -701982735, now seen corresponding path program 9 times [2019-12-18 22:02:04,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:04,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271821281] [2019-12-18 22:02:04,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:04,898 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 22:02:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271821281] [2019-12-18 22:02:04,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:04,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733655407] [2019-12-18 22:02:04,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:04,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:04,901 INFO L87 Difference]: Start difference. First operand 66193 states and 171564 transitions. Second operand 8 states. [2019-12-18 22:02:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:06,083 INFO L93 Difference]: Finished difference Result 70502 states and 180750 transitions. [2019-12-18 22:02:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:02:06,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 22:02:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:06,175 INFO L225 Difference]: With dead ends: 70502 [2019-12-18 22:02:06,176 INFO L226 Difference]: Without dead ends: 70502 [2019-12-18 22:02:06,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70502 states. [2019-12-18 22:02:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70502 to 55969. [2019-12-18 22:02:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55969 states. [2019-12-18 22:02:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55969 states to 55969 states and 142897 transitions. [2019-12-18 22:02:06,907 INFO L78 Accepts]: Start accepts. Automaton has 55969 states and 142897 transitions. Word has length 97 [2019-12-18 22:02:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 55969 states and 142897 transitions. [2019-12-18 22:02:06,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55969 states and 142897 transitions. [2019-12-18 22:02:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:06,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:06,962 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 22:02:06,962 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1254988047, now seen corresponding path program 10 times [2019-12-18 22:02:06,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:06,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823772751] [2019-12-18 22:02:06,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:07,171 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 22:02:07,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823772751] [2019-12-18 22:02:07,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:07,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:07,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374561852] [2019-12-18 22:02:07,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:07,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:07,173 INFO L87 Difference]: Start difference. First operand 55969 states and 142897 transitions. Second operand 10 states. [2019-12-18 22:02:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:08,629 INFO L93 Difference]: Finished difference Result 79859 states and 202992 transitions. [2019-12-18 22:02:08,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:02:08,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:08,748 INFO L225 Difference]: With dead ends: 79859 [2019-12-18 22:02:08,748 INFO L226 Difference]: Without dead ends: 79859 [2019-12-18 22:02:08,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:02:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79859 states. [2019-12-18 22:02:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79859 to 55669. [2019-12-18 22:02:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55669 states. [2019-12-18 22:02:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55669 states to 55669 states and 141388 transitions. [2019-12-18 22:02:10,083 INFO L78 Accepts]: Start accepts. Automaton has 55669 states and 141388 transitions. Word has length 97 [2019-12-18 22:02:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:10,084 INFO L462 AbstractCegarLoop]: Abstraction has 55669 states and 141388 transitions. [2019-12-18 22:02:10,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 55669 states and 141388 transitions. [2019-12-18 22:02:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:10,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:10,147 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 22:02:10,148 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash -70266019, now seen corresponding path program 11 times [2019-12-18 22:02:10,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:10,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922415234] [2019-12-18 22:02:10,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:10,409 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 22:02:10,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922415234] [2019-12-18 22:02:10,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:10,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:10,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673969544] [2019-12-18 22:02:10,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:10,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:10,412 INFO L87 Difference]: Start difference. First operand 55669 states and 141388 transitions. Second operand 11 states. [2019-12-18 22:02:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:12,443 INFO L93 Difference]: Finished difference Result 76190 states and 192981 transitions. [2019-12-18 22:02:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:02:12,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:12,565 INFO L225 Difference]: With dead ends: 76190 [2019-12-18 22:02:12,565 INFO L226 Difference]: Without dead ends: 76190 [2019-12-18 22:02:12,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:02:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76190 states. [2019-12-18 22:02:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76190 to 55418. [2019-12-18 22:02:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55418 states. [2019-12-18 22:02:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55418 states to 55418 states and 140657 transitions. [2019-12-18 22:02:13,473 INFO L78 Accepts]: Start accepts. Automaton has 55418 states and 140657 transitions. Word has length 97 [2019-12-18 22:02:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:13,473 INFO L462 AbstractCegarLoop]: Abstraction has 55418 states and 140657 transitions. [2019-12-18 22:02:13,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 55418 states and 140657 transitions. [2019-12-18 22:02:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:13,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:13,535 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 22:02:13,536 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash -653317221, now seen corresponding path program 12 times [2019-12-18 22:02:13,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:13,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801787245] [2019-12-18 22:02:13,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801787245] [2019-12-18 22:02:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322847775] [2019-12-18 22:02:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:13,735 INFO L87 Difference]: Start difference. First operand 55418 states and 140657 transitions. Second operand 10 states. [2019-12-18 22:02:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:15,490 INFO L93 Difference]: Finished difference Result 74779 states and 189497 transitions. [2019-12-18 22:02:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:02:15,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:15,598 INFO L225 Difference]: With dead ends: 74779 [2019-12-18 22:02:15,599 INFO L226 Difference]: Without dead ends: 74779 [2019-12-18 22:02:15,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74779 states. [2019-12-18 22:02:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74779 to 55727. [2019-12-18 22:02:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55727 states. [2019-12-18 22:02:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55727 states to 55727 states and 141406 transitions. [2019-12-18 22:02:16,773 INFO L78 Accepts]: Start accepts. Automaton has 55727 states and 141406 transitions. Word has length 97 [2019-12-18 22:02:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:16,773 INFO L462 AbstractCegarLoop]: Abstraction has 55727 states and 141406 transitions. [2019-12-18 22:02:16,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 55727 states and 141406 transitions. [2019-12-18 22:02:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:16,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:16,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:16,841 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2003234959, now seen corresponding path program 13 times [2019-12-18 22:02:16,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:16,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616512469] [2019-12-18 22:02:16,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:17,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 22:02:17,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616512469] [2019-12-18 22:02:17,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:17,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:02:17,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129364356] [2019-12-18 22:02:17,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:02:17,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:17,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:02:17,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:17,230 INFO L87 Difference]: Start difference. First operand 55727 states and 141406 transitions. Second operand 16 states. [2019-12-18 22:02:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:20,490 INFO L93 Difference]: Finished difference Result 62346 states and 155845 transitions. [2019-12-18 22:02:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 22:02:20,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-18 22:02:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:20,568 INFO L225 Difference]: With dead ends: 62346 [2019-12-18 22:02:20,568 INFO L226 Difference]: Without dead ends: 58507 [2019-12-18 22:02:20,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=346, Invalid=1910, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 22:02:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58507 states. [2019-12-18 22:02:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58507 to 56014. [2019-12-18 22:02:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56014 states. [2019-12-18 22:02:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56014 states to 56014 states and 141951 transitions. [2019-12-18 22:02:21,275 INFO L78 Accepts]: Start accepts. Automaton has 56014 states and 141951 transitions. Word has length 97 [2019-12-18 22:02:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:21,276 INFO L462 AbstractCegarLoop]: Abstraction has 56014 states and 141951 transitions. [2019-12-18 22:02:21,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:02:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 56014 states and 141951 transitions. [2019-12-18 22:02:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:21,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:21,334 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 22:02:21,334 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 969292719, now seen corresponding path program 14 times [2019-12-18 22:02:21,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:21,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227444900] [2019-12-18 22:02:21,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:21,828 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 3 [2019-12-18 22:02:21,927 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 22:02:21,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227444900] [2019-12-18 22:02:21,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:21,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:21,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107800672] [2019-12-18 22:02:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:21,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:21,929 INFO L87 Difference]: Start difference. First operand 56014 states and 141951 transitions. Second operand 11 states. [2019-12-18 22:02:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:23,746 INFO L93 Difference]: Finished difference Result 74542 states and 188438 transitions. [2019-12-18 22:02:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:02:23,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:23,850 INFO L225 Difference]: With dead ends: 74542 [2019-12-18 22:02:23,850 INFO L226 Difference]: Without dead ends: 74542 [2019-12-18 22:02:23,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74542 states. [2019-12-18 22:02:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74542 to 54924. [2019-12-18 22:02:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54924 states. [2019-12-18 22:02:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54924 states to 54924 states and 139280 transitions. [2019-12-18 22:02:24,649 INFO L78 Accepts]: Start accepts. Automaton has 54924 states and 139280 transitions. Word has length 97 [2019-12-18 22:02:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:24,650 INFO L462 AbstractCegarLoop]: Abstraction has 54924 states and 139280 transitions. [2019-12-18 22:02:24,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 54924 states and 139280 transitions. [2019-12-18 22:02:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:02:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:24,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:24,705 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 362203226, now seen corresponding path program 1 times [2019-12-18 22:02:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:24,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237488150] [2019-12-18 22:02:24,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:25,007 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 22:02:25,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237488150] [2019-12-18 22:02:25,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:25,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:02:25,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001324300] [2019-12-18 22:02:25,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:02:25,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:02:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:25,009 INFO L87 Difference]: Start difference. First operand 54924 states and 139280 transitions. Second operand 14 states. [2019-12-18 22:02:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:30,879 INFO L93 Difference]: Finished difference Result 129796 states and 326636 transitions. [2019-12-18 22:02:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 22:02:30,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-18 22:02:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:31,039 INFO L225 Difference]: With dead ends: 129796 [2019-12-18 22:02:31,039 INFO L226 Difference]: Without dead ends: 116451 [2019-12-18 22:02:31,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=544, Invalid=2878, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 22:02:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116451 states. [2019-12-18 22:02:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116451 to 73823. [2019-12-18 22:02:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73823 states. [2019-12-18 22:02:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73823 states to 73823 states and 189959 transitions. [2019-12-18 22:02:32,299 INFO L78 Accepts]: Start accepts. Automaton has 73823 states and 189959 transitions. Word has length 98 [2019-12-18 22:02:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:32,299 INFO L462 AbstractCegarLoop]: Abstraction has 73823 states and 189959 transitions. [2019-12-18 22:02:32,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:02:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 73823 states and 189959 transitions. [2019-12-18 22:02:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:02:32,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:32,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, 1, 1] [2019-12-18 22:02:32,399 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash -659775116, now seen corresponding path program 2 times [2019-12-18 22:02:32,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:32,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814191958] [2019-12-18 22:02:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:32,970 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 22:02:32,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814191958] [2019-12-18 22:02:32,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:32,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 22:02:32,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447607586] [2019-12-18 22:02:32,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 22:02:32,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 22:02:32,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:02:32,972 INFO L87 Difference]: Start difference. First operand 73823 states and 189959 transitions. Second operand 20 states. [2019-12-18 22:02:37,036 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-18 22:02:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:44,909 INFO L93 Difference]: Finished difference Result 101585 states and 258428 transitions. [2019-12-18 22:02:44,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-12-18 22:02:44,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-18 22:02:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:45,071 INFO L225 Difference]: With dead ends: 101585 [2019-12-18 22:02:45,071 INFO L226 Difference]: Without dead ends: 100257 [2019-12-18 22:02:45,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3634 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1215, Invalid=9291, Unknown=0, NotChecked=0, Total=10506 [2019-12-18 22:02:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100257 states. [2019-12-18 22:02:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100257 to 78810. [2019-12-18 22:02:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78810 states. [2019-12-18 22:02:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78810 states to 78810 states and 202782 transitions. [2019-12-18 22:02:46,815 INFO L78 Accepts]: Start accepts. Automaton has 78810 states and 202782 transitions. Word has length 98 [2019-12-18 22:02:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:46,815 INFO L462 AbstractCegarLoop]: Abstraction has 78810 states and 202782 transitions. [2019-12-18 22:02:46,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 22:02:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 78810 states and 202782 transitions. [2019-12-18 22:02:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:02:46,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:46,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:46,912 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1602007988, now seen corresponding path program 3 times [2019-12-18 22:02:46,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:46,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329203349] [2019-12-18 22:02:46,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:47,798 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 22:02:47,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329203349] [2019-12-18 22:02:47,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:47,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 22:02:47,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80125815] [2019-12-18 22:02:47,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 22:02:47,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 22:02:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:02:47,801 INFO L87 Difference]: Start difference. First operand 78810 states and 202782 transitions. Second operand 21 states. [2019-12-18 22:03:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:00,527 INFO L93 Difference]: Finished difference Result 140954 states and 357246 transitions. [2019-12-18 22:03:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-18 22:03:00,527 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 98 [2019-12-18 22:03:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:00,703 INFO L225 Difference]: With dead ends: 140954 [2019-12-18 22:03:00,703 INFO L226 Difference]: Without dead ends: 138704 [2019-12-18 22:03:00,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1076, Invalid=7296, Unknown=0, NotChecked=0, Total=8372 [2019-12-18 22:03:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138704 states. [2019-12-18 22:03:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138704 to 89661. [2019-12-18 22:03:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89661 states. [2019-12-18 22:03:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89661 states to 89661 states and 231209 transitions. [2019-12-18 22:03:02,130 INFO L78 Accepts]: Start accepts. Automaton has 89661 states and 231209 transitions. Word has length 98 [2019-12-18 22:03:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:02,131 INFO L462 AbstractCegarLoop]: Abstraction has 89661 states and 231209 transitions. [2019-12-18 22:03:02,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 22:03:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 89661 states and 231209 transitions. [2019-12-18 22:03:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:02,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:02,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:02,251 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 800255308, now seen corresponding path program 4 times [2019-12-18 22:03:02,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:02,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519181517] [2019-12-18 22:03:02,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:03,244 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 22:03:03,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519181517] [2019-12-18 22:03:03,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:03,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 22:03:03,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773863678] [2019-12-18 22:03:03,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 22:03:03,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 22:03:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:03:03,245 INFO L87 Difference]: Start difference. First operand 89661 states and 231209 transitions. Second operand 22 states. [2019-12-18 22:03:06,206 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-12-18 22:03:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:15,398 INFO L93 Difference]: Finished difference Result 119556 states and 305059 transitions. [2019-12-18 22:03:15,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-18 22:03:15,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2019-12-18 22:03:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:15,578 INFO L225 Difference]: With dead ends: 119556 [2019-12-18 22:03:15,578 INFO L226 Difference]: Without dead ends: 118634 [2019-12-18 22:03:15,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=906, Invalid=6234, Unknown=0, NotChecked=0, Total=7140 [2019-12-18 22:03:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118634 states. [2019-12-18 22:03:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118634 to 90002. [2019-12-18 22:03:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90002 states. [2019-12-18 22:03:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90002 states to 90002 states and 231966 transitions. [2019-12-18 22:03:17,401 INFO L78 Accepts]: Start accepts. Automaton has 90002 states and 231966 transitions. Word has length 98 [2019-12-18 22:03:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:17,401 INFO L462 AbstractCegarLoop]: Abstraction has 90002 states and 231966 transitions. [2019-12-18 22:03:17,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 22:03:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 90002 states and 231966 transitions. [2019-12-18 22:03:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:17,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:17,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:17,553 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1619850058, now seen corresponding path program 5 times [2019-12-18 22:03:17,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:17,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85476175] [2019-12-18 22:03:17,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:18,329 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 22:03:18,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85476175] [2019-12-18 22:03:18,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:18,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 22:03:18,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927555946] [2019-12-18 22:03:18,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 22:03:18,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 22:03:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:03:18,330 INFO L87 Difference]: Start difference. First operand 90002 states and 231966 transitions. Second operand 19 states. [2019-12-18 22:03:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:24,174 INFO L93 Difference]: Finished difference Result 130390 states and 334045 transitions. [2019-12-18 22:03:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 22:03:24,174 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-18 22:03:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:24,384 INFO L225 Difference]: With dead ends: 130390 [2019-12-18 22:03:24,384 INFO L226 Difference]: Without dead ends: 130186 [2019-12-18 22:03:24,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 22:03:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130186 states. [2019-12-18 22:03:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130186 to 92066. [2019-12-18 22:03:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92066 states. [2019-12-18 22:03:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92066 states to 92066 states and 236719 transitions. [2019-12-18 22:03:26,419 INFO L78 Accepts]: Start accepts. Automaton has 92066 states and 236719 transitions. Word has length 98 [2019-12-18 22:03:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:26,419 INFO L462 AbstractCegarLoop]: Abstraction has 92066 states and 236719 transitions. [2019-12-18 22:03:26,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 22:03:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 92066 states and 236719 transitions. [2019-12-18 22:03:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:26,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:26,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:26,537 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -572403006, now seen corresponding path program 6 times [2019-12-18 22:03:26,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:26,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282988221] [2019-12-18 22:03:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:27,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 22:03:27,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282988221] [2019-12-18 22:03:27,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:27,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:03:27,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282588632] [2019-12-18 22:03:27,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:03:27,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:03:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:03:27,848 INFO L87 Difference]: Start difference. First operand 92066 states and 236719 transitions. Second operand 23 states. Received shutdown request... [2019-12-18 22:03:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 22:03:34,137 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 22:03:34,140 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 22:03:34,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:34 BasicIcfg [2019-12-18 22:03:34,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:34,142 INFO L168 Benchmark]: Toolchain (without parser) took 227681.10 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 599.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,142 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.22 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 154.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 150.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,143 INFO L168 Benchmark]: Boogie Preprocessor took 64.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,144 INFO L168 Benchmark]: RCFGBuilder took 1094.15 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 147.7 MB in the beginning and 193.0 MB in the end (delta: -45.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,144 INFO L168 Benchmark]: TraceAbstraction took 225646.69 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 191.5 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 600.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:34,146 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.39 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.22 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 154.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 150.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1094.15 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 147.7 MB in the beginning and 193.0 MB in the end (delta: -45.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225646.69 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 191.5 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 600.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 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 (92066states) and FLOYD_HOARE automaton (currently 54 states, 23 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 66 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 (92066states) and FLOYD_HOARE automaton (currently 54 states, 23 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 225.4s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 145.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 18381 SDtfs, 31983 SDslu, 123749 SDs, 0 SdLazy, 101819 SolverSat, 2021 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1398 GetRequests, 126 SyntacticMatches, 73 SemanticMatches, 1198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24966 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156473occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 384454 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 3316 NumberOfCodeBlocks, 3316 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3276 ConstructedInterpolants, 0 QuantifiedInterpolants, 1744115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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