/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:58:14,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:58:14,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:58:14,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:58:14,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:58:14,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:58:14,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:58:14,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:58:14,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:58:14,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:58:14,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:58:14,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:58:14,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:58:14,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:58:14,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:58:14,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:58:14,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:58:14,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:58:14,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:58:14,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:58:14,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:58:14,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:58:14,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:58:14,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:58:14,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:58:14,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:58:14,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:58:14,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:58:14,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:58:14,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:58:14,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:58:14,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:58:14,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:58:14,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:58:14,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:58:14,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:58:14,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:58:14,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:58:14,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:58:14,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:58:14,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:58:14,272 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-NoLbe.epf [2019-12-19 03:58:14,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:58:14,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:58:14,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:58:14,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:58:14,303 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:58:14,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:58:14,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:58:14,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:58:14,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:58:14,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:58:14,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:58:14,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:58:14,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:58:14,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:58:14,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:58:14,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:58:14,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:58:14,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:58:14,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:58:14,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:58:14,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:58:14,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:58:14,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:58:14,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:58:14,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:58:14,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:58:14,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:58:14,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:58:14,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:58:14,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:58:14,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:58:14,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:58:14,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:58:14,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:58:14,621 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:58:14,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i [2019-12-19 03:58:14,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7a90a92/d5f20ece6cc541d29cbc1ef8ad6e07d1/FLAGed9477b50 [2019-12-19 03:58:15,261 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:58:15,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i [2019-12-19 03:58:15,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7a90a92/d5f20ece6cc541d29cbc1ef8ad6e07d1/FLAGed9477b50 [2019-12-19 03:58:15,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7a90a92/d5f20ece6cc541d29cbc1ef8ad6e07d1 [2019-12-19 03:58:15,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:58:15,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:58:15,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:15,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:58:15,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:58:15,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:15" (1/1) ... [2019-12-19 03:58:15,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500bc0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:15, skipping insertion in model container [2019-12-19 03:58:15,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:15" (1/1) ... [2019-12-19 03:58:15,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:58:15,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:58:16,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:16,184 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:58:16,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:16,373 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:58:16,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16 WrapperNode [2019-12-19 03:58:16,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:16,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:16,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:58:16,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:58:16,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:16,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:58:16,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:58:16,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:58:16,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (1/1) ... [2019-12-19 03:58:16,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:58:16,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:58:16,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:58:16,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:58:16,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (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-19 03:58:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:58:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:58:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:58:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:58:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:58:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:58:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:58:16,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:58:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:58:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:58:16,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:58:16,617 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:58:17,588 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:58:17,589 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:58:17,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:17 BoogieIcfgContainer [2019-12-19 03:58:17,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:58:17,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:58:17,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:58:17,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:58:17,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:58:15" (1/3) ... [2019-12-19 03:58:17,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7fd88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:17, skipping insertion in model container [2019-12-19 03:58:17,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:16" (2/3) ... [2019-12-19 03:58:17,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7fd88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:17, skipping insertion in model container [2019-12-19 03:58:17,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:17" (3/3) ... [2019-12-19 03:58:17,599 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.oepc.i [2019-12-19 03:58:17,609 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:58:17,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:58:17,617 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:58:17,618 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:58:17,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,691 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:17,758 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:58:17,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:58:17,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:58:17,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:58:17,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:58:17,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:58:17,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:58:17,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:58:17,782 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:58:17,798 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189 places, 244 transitions [2019-12-19 03:58:23,868 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 69535 states. [2019-12-19 03:58:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69535 states. [2019-12-19 03:58:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-19 03:58:23,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:23,881 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-19 03:58:23,881 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -800669215, now seen corresponding path program 1 times [2019-12-19 03:58:23,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:23,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43072809] [2019-12-19 03:58:23,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:24,213 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-19 03:58:24,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43072809] [2019-12-19 03:58:24,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:24,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:58:24,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396264461] [2019-12-19 03:58:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:58:24,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:58:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:58:24,239 INFO L87 Difference]: Start difference. First operand 69535 states. Second operand 4 states. [2019-12-19 03:58:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:26,491 INFO L93 Difference]: Finished difference Result 70487 states and 288560 transitions. [2019-12-19 03:58:26,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:58:26,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-19 03:58:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:27,097 INFO L225 Difference]: With dead ends: 70487 [2019-12-19 03:58:27,100 INFO L226 Difference]: Without dead ends: 62935 [2019-12-19 03:58:27,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:58:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62935 states. [2019-12-19 03:58:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62935 to 62935. [2019-12-19 03:58:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62935 states. [2019-12-19 03:58:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62935 states to 62935 states and 260088 transitions. [2019-12-19 03:58:33,921 INFO L78 Accepts]: Start accepts. Automaton has 62935 states and 260088 transitions. Word has length 38 [2019-12-19 03:58:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:33,922 INFO L462 AbstractCegarLoop]: Abstraction has 62935 states and 260088 transitions. [2019-12-19 03:58:33,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:58:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 62935 states and 260088 transitions. [2019-12-19 03:58:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 03:58:33,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:33,929 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] [2019-12-19 03:58:33,929 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1890140348, now seen corresponding path program 1 times [2019-12-19 03:58:33,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:33,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103235612] [2019-12-19 03:58:33,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:34,047 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-19 03:58:34,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103235612] [2019-12-19 03:58:34,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:34,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:34,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612110375] [2019-12-19 03:58:34,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:34,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:34,051 INFO L87 Difference]: Start difference. First operand 62935 states and 260088 transitions. Second operand 5 states. [2019-12-19 03:58:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:35,363 INFO L93 Difference]: Finished difference Result 102409 states and 395806 transitions. [2019-12-19 03:58:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:58:35,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 03:58:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:35,817 INFO L225 Difference]: With dead ends: 102409 [2019-12-19 03:58:35,818 INFO L226 Difference]: Without dead ends: 102265 [2019-12-19 03:58:35,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:58:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102265 states. [2019-12-19 03:58:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102265 to 100495. [2019-12-19 03:58:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100495 states. [2019-12-19 03:58:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100495 states to 100495 states and 389884 transitions. [2019-12-19 03:58:42,750 INFO L78 Accepts]: Start accepts. Automaton has 100495 states and 389884 transitions. Word has length 45 [2019-12-19 03:58:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:42,752 INFO L462 AbstractCegarLoop]: Abstraction has 100495 states and 389884 transitions. [2019-12-19 03:58:42,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:58:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 100495 states and 389884 transitions. [2019-12-19 03:58:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:58:42,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:42,757 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] [2019-12-19 03:58:42,757 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -267221954, now seen corresponding path program 1 times [2019-12-19 03:58:42,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:42,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353874153] [2019-12-19 03:58:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:42,906 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-19 03:58:42,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353874153] [2019-12-19 03:58:42,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:42,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:42,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346484862] [2019-12-19 03:58:42,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:42,912 INFO L87 Difference]: Start difference. First operand 100495 states and 389884 transitions. Second operand 5 states. [2019-12-19 03:58:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:46,903 INFO L93 Difference]: Finished difference Result 123001 states and 468917 transitions. [2019-12-19 03:58:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:58:46,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:58:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:47,234 INFO L225 Difference]: With dead ends: 123001 [2019-12-19 03:58:47,234 INFO L226 Difference]: Without dead ends: 122841 [2019-12-19 03:58:47,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:58:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122841 states. [2019-12-19 03:58:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122841 to 109850. [2019-12-19 03:58:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109850 states. [2019-12-19 03:58:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109850 states to 109850 states and 422838 transitions. [2019-12-19 03:58:50,891 INFO L78 Accepts]: Start accepts. Automaton has 109850 states and 422838 transitions. Word has length 46 [2019-12-19 03:58:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:50,892 INFO L462 AbstractCegarLoop]: Abstraction has 109850 states and 422838 transitions. [2019-12-19 03:58:50,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:58:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 109850 states and 422838 transitions. [2019-12-19 03:58:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:58:50,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:50,910 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] [2019-12-19 03:58:50,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash 676097697, now seen corresponding path program 1 times [2019-12-19 03:58:50,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:50,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994848470] [2019-12-19 03:58:50,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:51,006 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-19 03:58:51,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994848470] [2019-12-19 03:58:51,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:51,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:58:51,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50541445] [2019-12-19 03:58:51,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:58:51,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:58:51,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:58:51,009 INFO L87 Difference]: Start difference. First operand 109850 states and 422838 transitions. Second operand 6 states. [2019-12-19 03:58:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:53,591 INFO L93 Difference]: Finished difference Result 145202 states and 544226 transitions. [2019-12-19 03:58:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:58:53,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:58:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:53,977 INFO L225 Difference]: With dead ends: 145202 [2019-12-19 03:58:53,977 INFO L226 Difference]: Without dead ends: 145058 [2019-12-19 03:58:53,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:58:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145058 states. [2019-12-19 03:59:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145058 to 108813. [2019-12-19 03:59:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108813 states. [2019-12-19 03:59:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108813 states to 108813 states and 418993 transitions. [2019-12-19 03:59:02,198 INFO L78 Accepts]: Start accepts. Automaton has 108813 states and 418993 transitions. Word has length 53 [2019-12-19 03:59:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:02,198 INFO L462 AbstractCegarLoop]: Abstraction has 108813 states and 418993 transitions. [2019-12-19 03:59:02,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:59:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108813 states and 418993 transitions. [2019-12-19 03:59:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:59:02,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:02,243 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] [2019-12-19 03:59:02,243 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 316007622, now seen corresponding path program 1 times [2019-12-19 03:59:02,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:02,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195694757] [2019-12-19 03:59:02,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:02,394 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-19 03:59:02,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195694757] [2019-12-19 03:59:02,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:59:02,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443164242] [2019-12-19 03:59:02,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:59:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:59:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:59:02,397 INFO L87 Difference]: Start difference. First operand 108813 states and 418993 transitions. Second operand 6 states. [2019-12-19 03:59:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:03,803 INFO L93 Difference]: Finished difference Result 145663 states and 546005 transitions. [2019-12-19 03:59:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:59:03,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 03:59:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:05,258 INFO L225 Difference]: With dead ends: 145663 [2019-12-19 03:59:05,258 INFO L226 Difference]: Without dead ends: 145423 [2019-12-19 03:59:05,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:59:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145423 states. [2019-12-19 03:59:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145423 to 130402. [2019-12-19 03:59:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130402 states. [2019-12-19 03:59:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130402 states to 130402 states and 494392 transitions. [2019-12-19 03:59:10,529 INFO L78 Accepts]: Start accepts. Automaton has 130402 states and 494392 transitions. Word has length 60 [2019-12-19 03:59:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:10,530 INFO L462 AbstractCegarLoop]: Abstraction has 130402 states and 494392 transitions. [2019-12-19 03:59:10,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:59:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 130402 states and 494392 transitions. [2019-12-19 03:59:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 03:59:10,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:10,580 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] [2019-12-19 03:59:10,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash -392503108, now seen corresponding path program 1 times [2019-12-19 03:59:10,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:10,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450471061] [2019-12-19 03:59:10,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:10,644 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-19 03:59:10,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450471061] [2019-12-19 03:59:10,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:10,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:59:10,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784259283] [2019-12-19 03:59:10,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:59:10,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:59:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:59:10,646 INFO L87 Difference]: Start difference. First operand 130402 states and 494392 transitions. Second operand 3 states. [2019-12-19 03:59:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:16,026 INFO L93 Difference]: Finished difference Result 210818 states and 777868 transitions. [2019-12-19 03:59:16,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:59:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-19 03:59:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:16,676 INFO L225 Difference]: With dead ends: 210818 [2019-12-19 03:59:16,676 INFO L226 Difference]: Without dead ends: 210818 [2019-12-19 03:59:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:59:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210818 states. [2019-12-19 03:59:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210818 to 187534. [2019-12-19 03:59:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187534 states. [2019-12-19 03:59:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187534 states to 187534 states and 695635 transitions. [2019-12-19 03:59:22,669 INFO L78 Accepts]: Start accepts. Automaton has 187534 states and 695635 transitions. Word has length 62 [2019-12-19 03:59:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:22,669 INFO L462 AbstractCegarLoop]: Abstraction has 187534 states and 695635 transitions. [2019-12-19 03:59:22,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:59:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 187534 states and 695635 transitions. [2019-12-19 03:59:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:59:22,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:22,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:59:22,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash 319205498, now seen corresponding path program 1 times [2019-12-19 03:59:22,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:22,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186816452] [2019-12-19 03:59:22,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:22,863 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-19 03:59:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186816452] [2019-12-19 03:59:22,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:22,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:59:22,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154677071] [2019-12-19 03:59:22,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:59:22,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:59:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:59:22,866 INFO L87 Difference]: Start difference. First operand 187534 states and 695635 transitions. Second operand 7 states. [2019-12-19 03:59:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:29,366 INFO L93 Difference]: Finished difference Result 242757 states and 879896 transitions. [2019-12-19 03:59:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:59:29,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 03:59:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:30,648 INFO L225 Difference]: With dead ends: 242757 [2019-12-19 03:59:30,648 INFO L226 Difference]: Without dead ends: 242517 [2019-12-19 03:59:30,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 03:59:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242517 states. [2019-12-19 03:59:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242517 to 189100. [2019-12-19 03:59:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189100 states. [2019-12-19 03:59:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189100 states to 189100 states and 700966 transitions. [2019-12-19 03:59:41,133 INFO L78 Accepts]: Start accepts. Automaton has 189100 states and 700966 transitions. Word has length 66 [2019-12-19 03:59:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:41,134 INFO L462 AbstractCegarLoop]: Abstraction has 189100 states and 700966 transitions. [2019-12-19 03:59:41,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:59:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 189100 states and 700966 transitions. [2019-12-19 03:59:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:59:41,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:41,222 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] [2019-12-19 03:59:41,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:41,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1112040937, now seen corresponding path program 1 times [2019-12-19 03:59:41,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:41,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818510793] [2019-12-19 03:59:41,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:41,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-19 03:59:41,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818510793] [2019-12-19 03:59:41,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:41,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:59:41,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357298633] [2019-12-19 03:59:41,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:59:41,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:59:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:59:41,309 INFO L87 Difference]: Start difference. First operand 189100 states and 700966 transitions. Second operand 7 states. [2019-12-19 03:59:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:45,139 INFO L93 Difference]: Finished difference Result 251310 states and 908176 transitions. [2019-12-19 03:59:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:59:45,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:59:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:45,883 INFO L225 Difference]: With dead ends: 251310 [2019-12-19 03:59:45,883 INFO L226 Difference]: Without dead ends: 251110 [2019-12-19 03:59:45,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:59:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251110 states. [2019-12-19 03:59:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251110 to 198330. [2019-12-19 03:59:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198330 states. [2019-12-19 03:59:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198330 states to 198330 states and 732648 transitions. [2019-12-19 03:59:59,394 INFO L78 Accepts]: Start accepts. Automaton has 198330 states and 732648 transitions. Word has length 67 [2019-12-19 03:59:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:59,394 INFO L462 AbstractCegarLoop]: Abstraction has 198330 states and 732648 transitions. [2019-12-19 03:59:59,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:59:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 198330 states and 732648 transitions. [2019-12-19 03:59:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:59:59,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:59,500 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] [2019-12-19 03:59:59,500 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1623348742, now seen corresponding path program 1 times [2019-12-19 03:59:59,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:59,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566487563] [2019-12-19 03:59:59,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:59,629 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-19 03:59:59,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566487563] [2019-12-19 03:59:59,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:59,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:59:59,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068267454] [2019-12-19 03:59:59,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:59:59,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:59,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:59:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:59:59,632 INFO L87 Difference]: Start difference. First operand 198330 states and 732648 transitions. Second operand 6 states. [2019-12-19 04:00:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:07,135 INFO L93 Difference]: Finished difference Result 275504 states and 1015214 transitions. [2019-12-19 04:00:07,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:07,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 04:00:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:07,931 INFO L225 Difference]: With dead ends: 275504 [2019-12-19 04:00:07,931 INFO L226 Difference]: Without dead ends: 275504 [2019-12-19 04:00:07,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275504 states. [2019-12-19 04:00:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275504 to 236435. [2019-12-19 04:00:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236435 states. [2019-12-19 04:00:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236435 states to 236435 states and 875017 transitions. [2019-12-19 04:00:15,985 INFO L78 Accepts]: Start accepts. Automaton has 236435 states and 875017 transitions. Word has length 69 [2019-12-19 04:00:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:15,986 INFO L462 AbstractCegarLoop]: Abstraction has 236435 states and 875017 transitions. [2019-12-19 04:00:15,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 236435 states and 875017 transitions. [2019-12-19 04:00:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:00:16,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:16,115 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] [2019-12-19 04:00:16,115 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1710004537, now seen corresponding path program 1 times [2019-12-19 04:00:16,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:16,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334847201] [2019-12-19 04:00:16,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:16,241 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-19 04:00:16,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334847201] [2019-12-19 04:00:16,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:16,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:16,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293104395] [2019-12-19 04:00:16,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:16,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:16,244 INFO L87 Difference]: Start difference. First operand 236435 states and 875017 transitions. Second operand 7 states. [2019-12-19 04:00:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:24,745 INFO L93 Difference]: Finished difference Result 332957 states and 1206203 transitions. [2019-12-19 04:00:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:00:24,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 04:00:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:25,786 INFO L225 Difference]: With dead ends: 332957 [2019-12-19 04:00:25,786 INFO L226 Difference]: Without dead ends: 332957 [2019-12-19 04:00:25,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:00:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332957 states. [2019-12-19 04:00:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332957 to 310971. [2019-12-19 04:00:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310971 states. [2019-12-19 04:00:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310971 states to 310971 states and 1133528 transitions. [2019-12-19 04:00:41,300 INFO L78 Accepts]: Start accepts. Automaton has 310971 states and 1133528 transitions. Word has length 69 [2019-12-19 04:00:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:41,301 INFO L462 AbstractCegarLoop]: Abstraction has 310971 states and 1133528 transitions. [2019-12-19 04:00:41,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 310971 states and 1133528 transitions. [2019-12-19 04:00:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:00:41,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:41,525 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] [2019-12-19 04:00:41,525 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -465240056, now seen corresponding path program 1 times [2019-12-19 04:00:41,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:41,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323612644] [2019-12-19 04:00:41,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:41,609 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-19 04:00:41,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323612644] [2019-12-19 04:00:41,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:41,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:41,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836566812] [2019-12-19 04:00:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:41,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:41,611 INFO L87 Difference]: Start difference. First operand 310971 states and 1133528 transitions. Second operand 4 states. [2019-12-19 04:00:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:41,811 INFO L93 Difference]: Finished difference Result 48146 states and 153495 transitions. [2019-12-19 04:00:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:41,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 04:00:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:41,886 INFO L225 Difference]: With dead ends: 48146 [2019-12-19 04:00:41,887 INFO L226 Difference]: Without dead ends: 46262 [2019-12-19 04:00:41,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 04:00:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46262 states. [2019-12-19 04:00:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46262 to 46188. [2019-12-19 04:00:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46188 states. [2019-12-19 04:00:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46188 states to 46188 states and 147141 transitions. [2019-12-19 04:00:49,583 INFO L78 Accepts]: Start accepts. Automaton has 46188 states and 147141 transitions. Word has length 69 [2019-12-19 04:00:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:49,583 INFO L462 AbstractCegarLoop]: Abstraction has 46188 states and 147141 transitions. [2019-12-19 04:00:49,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46188 states and 147141 transitions. [2019-12-19 04:00:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 04:00:49,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:49,606 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] [2019-12-19 04:00:49,607 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1727588247, now seen corresponding path program 1 times [2019-12-19 04:00:49,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:49,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089482955] [2019-12-19 04:00:49,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:49,676 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-19 04:00:49,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089482955] [2019-12-19 04:00:49,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:49,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:49,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765707585] [2019-12-19 04:00:49,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:49,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:49,678 INFO L87 Difference]: Start difference. First operand 46188 states and 147141 transitions. Second operand 4 states. [2019-12-19 04:00:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:50,130 INFO L93 Difference]: Finished difference Result 55992 states and 176874 transitions. [2019-12-19 04:00:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:50,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 04:00:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:50,240 INFO L225 Difference]: With dead ends: 55992 [2019-12-19 04:00:50,240 INFO L226 Difference]: Without dead ends: 55992 [2019-12-19 04:00:50,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55992 states. [2019-12-19 04:00:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55992 to 49593. [2019-12-19 04:00:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49593 states. [2019-12-19 04:00:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49593 states to 49593 states and 157329 transitions. [2019-12-19 04:00:51,468 INFO L78 Accepts]: Start accepts. Automaton has 49593 states and 157329 transitions. Word has length 79 [2019-12-19 04:00:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:51,469 INFO L462 AbstractCegarLoop]: Abstraction has 49593 states and 157329 transitions. [2019-12-19 04:00:51,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 49593 states and 157329 transitions. [2019-12-19 04:00:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 04:00:51,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:51,495 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] [2019-12-19 04:00:51,495 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1472851702, now seen corresponding path program 1 times [2019-12-19 04:00:51,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:51,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320315319] [2019-12-19 04:00:51,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:51,635 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-19 04:00:51,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320315319] [2019-12-19 04:00:51,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:51,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:51,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713088393] [2019-12-19 04:00:51,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:51,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:51,638 INFO L87 Difference]: Start difference. First operand 49593 states and 157329 transitions. Second operand 8 states. [2019-12-19 04:00:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:53,334 INFO L93 Difference]: Finished difference Result 56799 states and 178120 transitions. [2019-12-19 04:00:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 04:00:53,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-12-19 04:00:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:53,428 INFO L225 Difference]: With dead ends: 56799 [2019-12-19 04:00:53,428 INFO L226 Difference]: Without dead ends: 56751 [2019-12-19 04:00:53,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 04:00:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56751 states. [2019-12-19 04:00:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56751 to 44460. [2019-12-19 04:00:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44460 states. [2019-12-19 04:00:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44460 states to 44460 states and 141688 transitions. [2019-12-19 04:00:54,635 INFO L78 Accepts]: Start accepts. Automaton has 44460 states and 141688 transitions. Word has length 79 [2019-12-19 04:00:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:54,635 INFO L462 AbstractCegarLoop]: Abstraction has 44460 states and 141688 transitions. [2019-12-19 04:00:54,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 44460 states and 141688 transitions. [2019-12-19 04:00:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:00:54,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:54,660 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] [2019-12-19 04:00:54,660 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1414672443, now seen corresponding path program 1 times [2019-12-19 04:00:54,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:54,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86160494] [2019-12-19 04:00:54,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:54,702 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-19 04:00:54,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86160494] [2019-12-19 04:00:54,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:54,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:54,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600194312] [2019-12-19 04:00:54,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:54,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:54,705 INFO L87 Difference]: Start difference. First operand 44460 states and 141688 transitions. Second operand 3 states. [2019-12-19 04:00:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:55,109 INFO L93 Difference]: Finished difference Result 45984 states and 146029 transitions. [2019-12-19 04:00:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:55,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 04:00:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:55,183 INFO L225 Difference]: With dead ends: 45984 [2019-12-19 04:00:55,183 INFO L226 Difference]: Without dead ends: 45984 [2019-12-19 04:00:55,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45984 states. [2019-12-19 04:00:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45984 to 45180. [2019-12-19 04:00:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45180 states. [2019-12-19 04:00:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45180 states to 45180 states and 143754 transitions. [2019-12-19 04:00:56,197 INFO L78 Accepts]: Start accepts. Automaton has 45180 states and 143754 transitions. Word has length 80 [2019-12-19 04:00:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:56,197 INFO L462 AbstractCegarLoop]: Abstraction has 45180 states and 143754 transitions. [2019-12-19 04:00:56,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 45180 states and 143754 transitions. [2019-12-19 04:00:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:00:56,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:56,224 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] [2019-12-19 04:00:56,224 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1521989665, now seen corresponding path program 1 times [2019-12-19 04:00:56,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:56,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886867752] [2019-12-19 04:00:56,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:56,343 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-19 04:00:56,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886867752] [2019-12-19 04:00:56,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:56,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:56,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036480388] [2019-12-19 04:00:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:56,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:56,346 INFO L87 Difference]: Start difference. First operand 45180 states and 143754 transitions. Second operand 7 states. [2019-12-19 04:00:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:57,949 INFO L93 Difference]: Finished difference Result 91592 states and 289557 transitions. [2019-12-19 04:00:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 04:00:57,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-19 04:00:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:58,128 INFO L225 Difference]: With dead ends: 91592 [2019-12-19 04:00:58,128 INFO L226 Difference]: Without dead ends: 91352 [2019-12-19 04:00:58,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-19 04:00:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91352 states. [2019-12-19 04:00:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91352 to 50959. [2019-12-19 04:00:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50959 states. [2019-12-19 04:00:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50959 states to 50959 states and 161075 transitions. [2019-12-19 04:00:59,599 INFO L78 Accepts]: Start accepts. Automaton has 50959 states and 161075 transitions. Word has length 82 [2019-12-19 04:00:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:59,599 INFO L462 AbstractCegarLoop]: Abstraction has 50959 states and 161075 transitions. [2019-12-19 04:00:59,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 50959 states and 161075 transitions. [2019-12-19 04:00:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:00:59,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:59,633 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] [2019-12-19 04:00:59,633 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1851755426, now seen corresponding path program 1 times [2019-12-19 04:00:59,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:59,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614648092] [2019-12-19 04:00:59,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:59,734 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-19 04:00:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614648092] [2019-12-19 04:00:59,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:59,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:59,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973634581] [2019-12-19 04:00:59,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:59,740 INFO L87 Difference]: Start difference. First operand 50959 states and 161075 transitions. Second operand 6 states. [2019-12-19 04:01:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:01,254 INFO L93 Difference]: Finished difference Result 69497 states and 216709 transitions. [2019-12-19 04:01:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:01:01,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-19 04:01:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:01,380 INFO L225 Difference]: With dead ends: 69497 [2019-12-19 04:01:01,380 INFO L226 Difference]: Without dead ends: 69095 [2019-12-19 04:01:01,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:01:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2019-12-19 04:01:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 57563. [2019-12-19 04:01:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57563 states. [2019-12-19 04:01:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57563 states to 57563 states and 181582 transitions. [2019-12-19 04:01:02,739 INFO L78 Accepts]: Start accepts. Automaton has 57563 states and 181582 transitions. Word has length 82 [2019-12-19 04:01:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:02,740 INFO L462 AbstractCegarLoop]: Abstraction has 57563 states and 181582 transitions. [2019-12-19 04:01:02,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:01:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 57563 states and 181582 transitions. [2019-12-19 04:01:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:01:02,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:02,780 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] [2019-12-19 04:01:02,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash -890141409, now seen corresponding path program 1 times [2019-12-19 04:01:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:02,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303283847] [2019-12-19 04:01:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:02,871 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-19 04:01:02,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303283847] [2019-12-19 04:01:02,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:02,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:01:02,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576245180] [2019-12-19 04:01:02,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:01:02,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:01:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:01:02,874 INFO L87 Difference]: Start difference. First operand 57563 states and 181582 transitions. Second operand 7 states. [2019-12-19 04:01:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:04,721 INFO L93 Difference]: Finished difference Result 82928 states and 255685 transitions. [2019-12-19 04:01:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:01:04,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-19 04:01:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:04,868 INFO L225 Difference]: With dead ends: 82928 [2019-12-19 04:01:04,868 INFO L226 Difference]: Without dead ends: 82856 [2019-12-19 04:01:04,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-19 04:01:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82856 states. [2019-12-19 04:01:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82856 to 64098. [2019-12-19 04:01:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64098 states. [2019-12-19 04:01:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 200126 transitions. [2019-12-19 04:01:06,313 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 200126 transitions. Word has length 82 [2019-12-19 04:01:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:06,313 INFO L462 AbstractCegarLoop]: Abstraction has 64098 states and 200126 transitions. [2019-12-19 04:01:06,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:01:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 200126 transitions. [2019-12-19 04:01:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:01:06,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:06,361 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] [2019-12-19 04:01:06,361 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1850294048, now seen corresponding path program 1 times [2019-12-19 04:01:06,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:06,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765195575] [2019-12-19 04:01:06,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:06,476 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-19 04:01:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765195575] [2019-12-19 04:01:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:01:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520883130] [2019-12-19 04:01:06,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:01:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:01:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:01:06,478 INFO L87 Difference]: Start difference. First operand 64098 states and 200126 transitions. Second operand 8 states. [2019-12-19 04:01:08,333 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-19 04:01:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:09,664 INFO L93 Difference]: Finished difference Result 84556 states and 259945 transitions. [2019-12-19 04:01:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 04:01:09,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-19 04:01:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:09,812 INFO L225 Difference]: With dead ends: 84556 [2019-12-19 04:01:09,812 INFO L226 Difference]: Without dead ends: 84253 [2019-12-19 04:01:09,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-19 04:01:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84253 states. [2019-12-19 04:01:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84253 to 60255. [2019-12-19 04:01:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2019-12-19 04:01:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 187468 transitions. [2019-12-19 04:01:10,910 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 187468 transitions. Word has length 82 [2019-12-19 04:01:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:10,910 INFO L462 AbstractCegarLoop]: Abstraction has 60255 states and 187468 transitions. [2019-12-19 04:01:10,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:01:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 187468 transitions. [2019-12-19 04:01:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:01:11,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:11,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:11,411 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -238294750, now seen corresponding path program 1 times [2019-12-19 04:01:11,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:11,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998783133] [2019-12-19 04:01:11,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:11,518 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-19 04:01:11,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998783133] [2019-12-19 04:01:11,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:11,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:01:11,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670947967] [2019-12-19 04:01:11,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:01:11,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:01:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:01:11,521 INFO L87 Difference]: Start difference. First operand 60255 states and 187468 transitions. Second operand 5 states. [2019-12-19 04:01:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:11,888 INFO L93 Difference]: Finished difference Result 81091 states and 256029 transitions. [2019-12-19 04:01:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:01:11,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-19 04:01:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:12,038 INFO L225 Difference]: With dead ends: 81091 [2019-12-19 04:01:12,038 INFO L226 Difference]: Without dead ends: 81091 [2019-12-19 04:01:12,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:01:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81091 states. [2019-12-19 04:01:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81091 to 47704. [2019-12-19 04:01:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47704 states. [2019-12-19 04:01:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47704 states to 47704 states and 148715 transitions. [2019-12-19 04:01:12,954 INFO L78 Accepts]: Start accepts. Automaton has 47704 states and 148715 transitions. Word has length 82 [2019-12-19 04:01:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:12,954 INFO L462 AbstractCegarLoop]: Abstraction has 47704 states and 148715 transitions. [2019-12-19 04:01:12,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:01:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47704 states and 148715 transitions. [2019-12-19 04:01:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:01:12,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:12,982 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] [2019-12-19 04:01:12,982 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 242421666, now seen corresponding path program 1 times [2019-12-19 04:01:12,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:12,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692617351] [2019-12-19 04:01:12,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:13,095 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-19 04:01:13,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692617351] [2019-12-19 04:01:13,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:13,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 04:01:13,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519711788] [2019-12-19 04:01:13,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 04:01:13,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 04:01:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:01:13,097 INFO L87 Difference]: Start difference. First operand 47704 states and 148715 transitions. Second operand 9 states. [2019-12-19 04:01:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:16,120 INFO L93 Difference]: Finished difference Result 66175 states and 202288 transitions. [2019-12-19 04:01:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 04:01:16,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-12-19 04:01:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:16,234 INFO L225 Difference]: With dead ends: 66175 [2019-12-19 04:01:16,234 INFO L226 Difference]: Without dead ends: 66175 [2019-12-19 04:01:16,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-19 04:01:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66175 states. [2019-12-19 04:01:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66175 to 56422. [2019-12-19 04:01:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56422 states. [2019-12-19 04:01:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56422 states to 56422 states and 175347 transitions. [2019-12-19 04:01:17,152 INFO L78 Accepts]: Start accepts. Automaton has 56422 states and 175347 transitions. Word has length 82 [2019-12-19 04:01:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:17,152 INFO L462 AbstractCegarLoop]: Abstraction has 56422 states and 175347 transitions. [2019-12-19 04:01:17,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 04:01:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 56422 states and 175347 transitions. [2019-12-19 04:01:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:01:17,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:17,193 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] [2019-12-19 04:01:17,193 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:17,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1487186147, now seen corresponding path program 1 times [2019-12-19 04:01:17,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:17,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829059417] [2019-12-19 04:01:17,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:17,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-19 04:01:17,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829059417] [2019-12-19 04:01:17,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:17,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:01:17,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196641683] [2019-12-19 04:01:17,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:01:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:01:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:01:17,247 INFO L87 Difference]: Start difference. First operand 56422 states and 175347 transitions. Second operand 3 states. [2019-12-19 04:01:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:17,759 INFO L93 Difference]: Finished difference Result 44575 states and 137947 transitions. [2019-12-19 04:01:17,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:01:17,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-19 04:01:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:17,833 INFO L225 Difference]: With dead ends: 44575 [2019-12-19 04:01:17,833 INFO L226 Difference]: Without dead ends: 44497 [2019-12-19 04:01:17,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 04:01:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44497 states. [2019-12-19 04:01:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44497 to 43650. [2019-12-19 04:01:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43650 states. [2019-12-19 04:01:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43650 states to 43650 states and 135313 transitions. [2019-12-19 04:01:18,448 INFO L78 Accepts]: Start accepts. Automaton has 43650 states and 135313 transitions. Word has length 82 [2019-12-19 04:01:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:18,448 INFO L462 AbstractCegarLoop]: Abstraction has 43650 states and 135313 transitions. [2019-12-19 04:01:18,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:01:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43650 states and 135313 transitions. [2019-12-19 04:01:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 04:01:18,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:18,472 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] [2019-12-19 04:01:18,472 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:18,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1028938358, now seen corresponding path program 1 times [2019-12-19 04:01:18,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:18,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31869950] [2019-12-19 04:01:18,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:18,564 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-19 04:01:18,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31869950] [2019-12-19 04:01:18,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:18,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:01:18,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357805032] [2019-12-19 04:01:18,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:01:18,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:01:18,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:01:18,567 INFO L87 Difference]: Start difference. First operand 43650 states and 135313 transitions. Second operand 6 states. [2019-12-19 04:01:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:19,946 INFO L93 Difference]: Finished difference Result 71571 states and 220405 transitions. [2019-12-19 04:01:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:01:19,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 04:01:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:20,076 INFO L225 Difference]: With dead ends: 71571 [2019-12-19 04:01:20,076 INFO L226 Difference]: Without dead ends: 71493 [2019-12-19 04:01:20,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:01:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71493 states. [2019-12-19 04:01:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71493 to 59532. [2019-12-19 04:01:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59532 states. [2019-12-19 04:01:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59532 states to 59532 states and 185865 transitions. [2019-12-19 04:01:21,334 INFO L78 Accepts]: Start accepts. Automaton has 59532 states and 185865 transitions. Word has length 83 [2019-12-19 04:01:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:21,334 INFO L462 AbstractCegarLoop]: Abstraction has 59532 states and 185865 transitions. [2019-12-19 04:01:21,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:01:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 59532 states and 185865 transitions. [2019-12-19 04:01:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 04:01:21,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:21,369 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] [2019-12-19 04:01:21,369 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2021264457, now seen corresponding path program 1 times [2019-12-19 04:01:21,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:21,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230601713] [2019-12-19 04:01:21,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:21,451 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-19 04:01:21,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230601713] [2019-12-19 04:01:21,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:21,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:01:21,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186077420] [2019-12-19 04:01:21,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:01:21,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:01:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:01:21,456 INFO L87 Difference]: Start difference. First operand 59532 states and 185865 transitions. Second operand 5 states. [2019-12-19 04:01:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:21,498 INFO L93 Difference]: Finished difference Result 5478 states and 13323 transitions. [2019-12-19 04:01:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:01:21,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-19 04:01:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:21,503 INFO L225 Difference]: With dead ends: 5478 [2019-12-19 04:01:21,503 INFO L226 Difference]: Without dead ends: 4611 [2019-12-19 04:01:21,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 04:01:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-12-19 04:01:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4025. [2019-12-19 04:01:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4025 states. [2019-12-19 04:01:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 9552 transitions. [2019-12-19 04:01:21,544 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 9552 transitions. Word has length 83 [2019-12-19 04:01:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:21,544 INFO L462 AbstractCegarLoop]: Abstraction has 4025 states and 9552 transitions. [2019-12-19 04:01:21,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:01:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 9552 transitions. [2019-12-19 04:01:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:21,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:21,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:21,548 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash -210467359, now seen corresponding path program 1 times [2019-12-19 04:01:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:21,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971775462] [2019-12-19 04:01:21,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:21,622 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-19 04:01:21,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971775462] [2019-12-19 04:01:21,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:21,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:01:21,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404432750] [2019-12-19 04:01:21,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:01:21,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:01:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:01:21,624 INFO L87 Difference]: Start difference. First operand 4025 states and 9552 transitions. Second operand 4 states. [2019-12-19 04:01:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:21,800 INFO L93 Difference]: Finished difference Result 4502 states and 10600 transitions. [2019-12-19 04:01:21,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:01:21,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-19 04:01:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:21,807 INFO L225 Difference]: With dead ends: 4502 [2019-12-19 04:01:21,807 INFO L226 Difference]: Without dead ends: 4502 [2019-12-19 04:01:21,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:01:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2019-12-19 04:01:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4115. [2019-12-19 04:01:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4115 states. [2019-12-19 04:01:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 9745 transitions. [2019-12-19 04:01:21,896 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 9745 transitions. Word has length 112 [2019-12-19 04:01:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:21,896 INFO L462 AbstractCegarLoop]: Abstraction has 4115 states and 9745 transitions. [2019-12-19 04:01:21,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:01:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 9745 transitions. [2019-12-19 04:01:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:21,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:21,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:21,904 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1133150942, now seen corresponding path program 1 times [2019-12-19 04:01:21,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:21,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027739794] [2019-12-19 04:01:21,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:22,073 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-19 04:01:22,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027739794] [2019-12-19 04:01:22,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:22,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 04:01:22,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824106547] [2019-12-19 04:01:22,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 04:01:22,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 04:01:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:01:22,076 INFO L87 Difference]: Start difference. First operand 4115 states and 9745 transitions. Second operand 9 states. [2019-12-19 04:01:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:24,082 INFO L93 Difference]: Finished difference Result 6838 states and 15607 transitions. [2019-12-19 04:01:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 04:01:24,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-12-19 04:01:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:24,092 INFO L225 Difference]: With dead ends: 6838 [2019-12-19 04:01:24,092 INFO L226 Difference]: Without dead ends: 6794 [2019-12-19 04:01:24,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-12-19 04:01:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6794 states. [2019-12-19 04:01:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6794 to 5282. [2019-12-19 04:01:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5282 states. [2019-12-19 04:01:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 12168 transitions. [2019-12-19 04:01:24,153 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 12168 transitions. Word has length 112 [2019-12-19 04:01:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:24,154 INFO L462 AbstractCegarLoop]: Abstraction has 5282 states and 12168 transitions. [2019-12-19 04:01:24,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 04:01:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 12168 transitions. [2019-12-19 04:01:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:24,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:24,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:24,161 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1226156067, now seen corresponding path program 1 times [2019-12-19 04:01:24,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:24,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876136131] [2019-12-19 04:01:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:24,278 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-19 04:01:24,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876136131] [2019-12-19 04:01:24,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:24,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:01:24,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794885657] [2019-12-19 04:01:24,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:01:24,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:01:24,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:01:24,280 INFO L87 Difference]: Start difference. First operand 5282 states and 12168 transitions. Second operand 7 states. [2019-12-19 04:01:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:24,776 INFO L93 Difference]: Finished difference Result 7975 states and 17730 transitions. [2019-12-19 04:01:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:01:24,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-19 04:01:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:24,792 INFO L225 Difference]: With dead ends: 7975 [2019-12-19 04:01:24,792 INFO L226 Difference]: Without dead ends: 7975 [2019-12-19 04:01:24,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:01:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2019-12-19 04:01:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 6347. [2019-12-19 04:01:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6347 states. [2019-12-19 04:01:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 14439 transitions. [2019-12-19 04:01:24,920 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 14439 transitions. Word has length 112 [2019-12-19 04:01:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:24,920 INFO L462 AbstractCegarLoop]: Abstraction has 6347 states and 14439 transitions. [2019-12-19 04:01:24,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:01:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 14439 transitions. [2019-12-19 04:01:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:24,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:24,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:24,930 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1555921828, now seen corresponding path program 1 times [2019-12-19 04:01:24,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:24,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75623136] [2019-12-19 04:01:24,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:25,039 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-19 04:01:25,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75623136] [2019-12-19 04:01:25,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:25,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:01:25,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545596552] [2019-12-19 04:01:25,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:01:25,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:01:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:01:25,041 INFO L87 Difference]: Start difference. First operand 6347 states and 14439 transitions. Second operand 8 states. [2019-12-19 04:01:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:26,164 INFO L93 Difference]: Finished difference Result 7451 states and 16719 transitions. [2019-12-19 04:01:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-19 04:01:26,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-19 04:01:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:26,174 INFO L225 Difference]: With dead ends: 7451 [2019-12-19 04:01:26,174 INFO L226 Difference]: Without dead ends: 7451 [2019-12-19 04:01:26,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-19 04:01:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2019-12-19 04:01:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 6513. [2019-12-19 04:01:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6513 states. [2019-12-19 04:01:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6513 states to 6513 states and 14769 transitions. [2019-12-19 04:01:26,246 INFO L78 Accepts]: Start accepts. Automaton has 6513 states and 14769 transitions. Word has length 112 [2019-12-19 04:01:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:26,246 INFO L462 AbstractCegarLoop]: Abstraction has 6513 states and 14769 transitions. [2019-12-19 04:01:26,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:01:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6513 states and 14769 transitions. [2019-12-19 04:01:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:26,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:26,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:26,253 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -454182013, now seen corresponding path program 1 times [2019-12-19 04:01:26,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:26,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428679216] [2019-12-19 04:01:26,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:26,323 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-19 04:01:26,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428679216] [2019-12-19 04:01:26,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:26,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:01:26,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897018865] [2019-12-19 04:01:26,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:01:26,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:01:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:01:26,325 INFO L87 Difference]: Start difference. First operand 6513 states and 14769 transitions. Second operand 4 states. [2019-12-19 04:01:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:26,645 INFO L93 Difference]: Finished difference Result 6918 states and 15714 transitions. [2019-12-19 04:01:26,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:01:26,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-19 04:01:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:26,654 INFO L225 Difference]: With dead ends: 6918 [2019-12-19 04:01:26,654 INFO L226 Difference]: Without dead ends: 6882 [2019-12-19 04:01:26,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 04:01:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2019-12-19 04:01:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6395. [2019-12-19 04:01:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-12-19 04:01:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 14522 transitions. [2019-12-19 04:01:26,750 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 14522 transitions. Word has length 112 [2019-12-19 04:01:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:26,751 INFO L462 AbstractCegarLoop]: Abstraction has 6395 states and 14522 transitions. [2019-12-19 04:01:26,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:01:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 14522 transitions. [2019-12-19 04:01:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:26,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:26,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:26,759 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash -737332477, now seen corresponding path program 1 times [2019-12-19 04:01:26,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:26,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616819013] [2019-12-19 04:01:26,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:26,859 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-19 04:01:26,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616819013] [2019-12-19 04:01:26,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:26,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:01:26,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960817320] [2019-12-19 04:01:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:01:26,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:01:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:01:26,860 INFO L87 Difference]: Start difference. First operand 6395 states and 14522 transitions. Second operand 5 states. [2019-12-19 04:01:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:27,093 INFO L93 Difference]: Finished difference Result 6575 states and 14897 transitions. [2019-12-19 04:01:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:01:27,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-19 04:01:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:27,101 INFO L225 Difference]: With dead ends: 6575 [2019-12-19 04:01:27,101 INFO L226 Difference]: Without dead ends: 6557 [2019-12-19 04:01:27,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:01:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2019-12-19 04:01:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 5894. [2019-12-19 04:01:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5894 states. [2019-12-19 04:01:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 13415 transitions. [2019-12-19 04:01:27,162 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 13415 transitions. Word has length 112 [2019-12-19 04:01:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:27,162 INFO L462 AbstractCegarLoop]: Abstraction has 5894 states and 13415 transitions. [2019-12-19 04:01:27,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:01:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 13415 transitions. [2019-12-19 04:01:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:27,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:27,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:27,168 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 507432004, now seen corresponding path program 1 times [2019-12-19 04:01:27,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:27,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256914021] [2019-12-19 04:01:27,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:27,248 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-19 04:01:27,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256914021] [2019-12-19 04:01:27,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:01:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083333613] [2019-12-19 04:01:27,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:01:27,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:01:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:01:27,250 INFO L87 Difference]: Start difference. First operand 5894 states and 13415 transitions. Second operand 4 states. [2019-12-19 04:01:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:27,546 INFO L93 Difference]: Finished difference Result 7527 states and 17035 transitions. [2019-12-19 04:01:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:01:27,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-19 04:01:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:27,557 INFO L225 Difference]: With dead ends: 7527 [2019-12-19 04:01:27,557 INFO L226 Difference]: Without dead ends: 7527 [2019-12-19 04:01:27,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:01:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7527 states. [2019-12-19 04:01:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7527 to 5822. [2019-12-19 04:01:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2019-12-19 04:01:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13232 transitions. [2019-12-19 04:01:27,654 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13232 transitions. Word has length 112 [2019-12-19 04:01:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 5822 states and 13232 transitions. [2019-12-19 04:01:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:01:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13232 transitions. [2019-12-19 04:01:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:01:27,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:27,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:27,662 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -749638060, now seen corresponding path program 2 times [2019-12-19 04:01:27,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:27,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98155945] [2019-12-19 04:01:27,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:27,714 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-19 04:01:27,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98155945] [2019-12-19 04:01:27,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:27,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:01:27,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831024012] [2019-12-19 04:01:27,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:01:27,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:01:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:01:27,716 INFO L87 Difference]: Start difference. First operand 5822 states and 13232 transitions. Second operand 5 states. [2019-12-19 04:01:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:28,033 INFO L93 Difference]: Finished difference Result 6390 states and 14357 transitions. [2019-12-19 04:01:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:01:28,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-19 04:01:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:28,042 INFO L225 Difference]: With dead ends: 6390 [2019-12-19 04:01:28,042 INFO L226 Difference]: Without dead ends: 6390 [2019-12-19 04:01:28,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:01:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6390 states. [2019-12-19 04:01:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6390 to 5984. [2019-12-19 04:01:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5984 states. [2019-12-19 04:01:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 13565 transitions. [2019-12-19 04:01:28,144 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 13565 transitions. Word has length 112 [2019-12-19 04:01:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:28,145 INFO L462 AbstractCegarLoop]: Abstraction has 5984 states and 13565 transitions. [2019-12-19 04:01:28,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:01:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 13565 transitions. Received shutdown request... [2019-12-19 04:01:28,152 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-19 04:01:28,166 WARN L227 ceAbstractionStarter]: Timeout [2019-12-19 04:01:28,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:01:28 BasicIcfg [2019-12-19 04:01:28,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:01:28,174 INFO L168 Benchmark]: Toolchain (without parser) took 192614.21 ms. Allocated memory was 138.4 MB in the beginning and 4.5 GB in the end (delta: 4.4 GB). Free memory was 101.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,175 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.56 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 156.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,180 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,180 INFO L168 Benchmark]: RCFGBuilder took 1087.73 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.0 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,181 INFO L168 Benchmark]: TraceAbstraction took 190575.19 ms. Allocated memory was 203.4 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 94.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:28,186 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.56 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 156.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1087.73 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.0 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190575.19 ms. Allocated memory was 203.4 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 94.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while IsEmpty was searching accepting run (input had 5984 states). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while IsEmpty was searching accepting run (input had 5984 states). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: TIMEOUT, OverallTime: 190.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 73.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15658 SDtfs, 17825 SDslu, 40050 SDs, 0 SdLazy, 20501 SolverSat, 1049 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 101 SyntacticMatches, 21 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310971occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 105.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 435072 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2518 NumberOfCodeBlocks, 2518 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2487 ConstructedInterpolants, 0 QuantifiedInterpolants, 462747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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