/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:25:49,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:25:49,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:25:50,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:25:50,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:25:50,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:25:50,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:25:50,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:25:50,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:25:50,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:25:50,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:25:50,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:25:50,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:25:50,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:25:50,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:25:50,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:25:50,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:25:50,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:25:50,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:25:50,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:25:50,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:25:50,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:25:50,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:25:50,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:25:50,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:25:50,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:25:50,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:25:50,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:25:50,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:25:50,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:25:50,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:25:50,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:25:50,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:25:50,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:25:50,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:25:50,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:25:50,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:25:50,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:25:50,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:25:50,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:25:50,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:25:50,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:25:50,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:25:50,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:25:50,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:25:50,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:25:50,058 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:25:50,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:25:50,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:25:50,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:25:50,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:25:50,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:25:50,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:25:50,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:25:50,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:25:50,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:25:50,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:25:50,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:25:50,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:25:50,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:25:50,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:25:50,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:25:50,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:25:50,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:25:50,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:25:50,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:25:50,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:25:50,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:25:50,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:25:50,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:25:50,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:25:50,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:25:50,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:25:50,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:25:50,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:25:50,345 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:25:50,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-18 18:25:50,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899dcf190/14e39cb0616c464b8fd764f79f17af8a/FLAG63e6f174b [2019-12-18 18:25:51,007 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:25:51,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-18 18:25:51,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899dcf190/14e39cb0616c464b8fd764f79f17af8a/FLAG63e6f174b [2019-12-18 18:25:51,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899dcf190/14e39cb0616c464b8fd764f79f17af8a [2019-12-18 18:25:51,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:25:51,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:25:51,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:25:51,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:25:51,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:25:51,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:25:51" (1/1) ... [2019-12-18 18:25:51,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c14d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:51, skipping insertion in model container [2019-12-18 18:25:51,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:25:51" (1/1) ... [2019-12-18 18:25:51,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:25:51,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:25:51,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:25:51,920 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:25:51,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:25:52,068 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:25:52,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52 WrapperNode [2019-12-18 18:25:52,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:25:52,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:25:52,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:25:52,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:25:52,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:25:52,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:25:52,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:25:52,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:25:52,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... [2019-12-18 18:25:52,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:25:52,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:25:52,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:25:52,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:25:52,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:25:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:25:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:25:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:25:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:25:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:25:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:25:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:25:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:25:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:25:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:25:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:25:52,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:25:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:25:52,249 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:25:53,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:25:53,021 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:25:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:25:53 BoogieIcfgContainer [2019-12-18 18:25:53,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:25:53,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:25:53,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:25:53,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:25:53,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:25:51" (1/3) ... [2019-12-18 18:25:53,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572c7daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:25:53, skipping insertion in model container [2019-12-18 18:25:53,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:25:52" (2/3) ... [2019-12-18 18:25:53,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572c7daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:25:53, skipping insertion in model container [2019-12-18 18:25:53,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:25:53" (3/3) ... [2019-12-18 18:25:53,033 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2019-12-18 18:25:53,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:25:53,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:25:53,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:25:53,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:25:53,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,137 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,142 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:25:53,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:25:53,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:25:53,205 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:25:53,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:25:53,205 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:25:53,205 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:25:53,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:25:53,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:25:53,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:25:53,223 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 18:25:53,225 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:25:53,314 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:25:53,314 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:25:53,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:25:53,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:25:53,408 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:25:53,408 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:25:53,422 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:25:53,445 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:25:53,446 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:25:57,212 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 18:25:59,359 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:25:59,468 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:25:59,595 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-18 18:25:59,595 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 18:25:59,599 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 18:26:11,655 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 18:26:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 18:26:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:26:11,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:26:11,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:26:11,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:26:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:26:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-18 18:26:11,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:26:11,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597788984] [2019-12-18 18:26:11,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:26:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:26:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:26:11,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597788984] [2019-12-18 18:26:11,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:26:11,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:26:11,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246126998] [2019-12-18 18:26:11,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:26:11,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:26:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:26:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:26:11,960 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 18:26:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:26:15,165 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 18:26:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:26:15,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:26:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:26:15,814 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 18:26:15,814 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 18:26:15,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:26:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 18:26:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 18:26:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 18:26:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 18:26:23,263 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 18:26:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:26:23,263 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 18:26:23,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:26:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 18:26:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:26:23,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:26:23,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:26:23,272 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:26:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:26:23,273 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-18 18:26:23,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:26:23,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239157180] [2019-12-18 18:26:23,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:26:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:26:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:26:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239157180] [2019-12-18 18:26:23,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:26:23,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:26:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34378764] [2019-12-18 18:26:23,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:26:23,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:26:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:26:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:26:23,379 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 18:26:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:26:27,178 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 18:26:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:26:27,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:26:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:26:27,857 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 18:26:27,857 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 18:26:27,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:26:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 18:26:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 18:26:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 18:26:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 18:26:39,258 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 18:26:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:26:39,259 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 18:26:39,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:26:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 18:26:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:26:39,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:26:39,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:26:39,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:26:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:26:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-18 18:26:39,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:26:39,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546556730] [2019-12-18 18:26:39,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:26:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:26:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:26:39,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546556730] [2019-12-18 18:26:39,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:26:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:26:39,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569858952] [2019-12-18 18:26:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:26:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:26:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:26:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:26:39,351 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 18:26:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:26:44,859 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 18:26:44,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:26:44,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:26:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:26:45,443 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 18:26:45,443 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 18:26:45,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:26:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 18:26:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 18:26:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 18:26:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 18:26:52,536 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 18:26:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:26:52,536 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 18:26:52,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:26:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 18:26:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:26:52,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:26:52,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:26:52,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:26:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:26:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-18 18:26:52,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:26:52,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523654049] [2019-12-18 18:26:52,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:26:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:26:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:26:52,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523654049] [2019-12-18 18:26:52,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:26:52,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:26:52,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633573626] [2019-12-18 18:26:52,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:26:52,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:26:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:26:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:26:52,608 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 18:26:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:26:53,515 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 18:26:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:26:53,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 18:26:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:27:00,306 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 18:27:00,307 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 18:27:00,307 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-18 18:27:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 18:27:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 18:27:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 18:27:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 18:27:06,989 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 18:27:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:27:06,990 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 18:27:06,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:27:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 18:27:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:27:06,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:27:06,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:27:06,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:27:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:27:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-18 18:27:06,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:27:06,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728718067] [2019-12-18 18:27:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:27:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:27:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:27:07,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728718067] [2019-12-18 18:27:07,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:27:07,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:27:07,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528948649] [2019-12-18 18:27:07,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:27:07,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:27:07,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:27:07,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:27:07,079 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 18:27:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:27:09,225 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 18:27:09,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:27:09,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:27:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:27:09,752 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 18:27:09,752 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 18:27:09,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:27:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 18:27:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 18:27:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 18:27:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 18:27:24,643 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 18:27:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:27:24,643 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 18:27:24,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:27:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 18:27:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:27:24,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:27:24,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:27:24,647 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:27:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:27:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-18 18:27:24,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:27:24,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86806064] [2019-12-18 18:27:24,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:27:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:27:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:27:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86806064] [2019-12-18 18:27:24,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:27:24,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:27:24,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915786369] [2019-12-18 18:27:24,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:27:24,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:27:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:27:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:27:24,723 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 18:27:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:27:31,264 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 18:27:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:27:31,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:27:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:27:31,819 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 18:27:31,820 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 18:27:31,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:27:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 18:27:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 18:27:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 18:27:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 18:27:39,750 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 18:27:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:27:39,750 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 18:27:39,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:27:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 18:27:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 18:27:39,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:27:39,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:27:39,769 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:27:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:27:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-18 18:27:39,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:27:39,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782094134] [2019-12-18 18:27:39,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:27:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:27:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:27:39,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782094134] [2019-12-18 18:27:39,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:27:39,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:27:39,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721233887] [2019-12-18 18:27:39,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:27:39,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:27:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:27:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:27:39,820 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 18:27:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:27:40,645 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 18:27:40,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:27:40,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 18:27:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:27:47,493 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 18:27:47,493 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 18:27:47,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:27:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 18:27:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 18:27:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 18:27:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 18:27:54,086 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 18:27:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:27:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 18:27:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:27:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 18:27:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:27:54,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:27:54,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:27:54,107 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:27:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:27:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-18 18:27:54,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:27:54,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635805230] [2019-12-18 18:27:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:27:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:27:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:27:54,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635805230] [2019-12-18 18:27:54,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:27:54,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:27:54,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498362925] [2019-12-18 18:27:54,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:27:54,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:27:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:27:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:27:54,178 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 18:28:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:00,741 INFO L93 Difference]: Finished difference Result 297697 states and 1230452 transitions. [2019-12-18 18:28:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:28:00,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:28:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:02,133 INFO L225 Difference]: With dead ends: 297697 [2019-12-18 18:28:02,133 INFO L226 Difference]: Without dead ends: 170729 [2019-12-18 18:28:02,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170729 states. [2019-12-18 18:28:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170729 to 169732. [2019-12-18 18:28:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169732 states. [2019-12-18 18:28:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169732 states to 169732 states and 694021 transitions. [2019-12-18 18:28:13,624 INFO L78 Accepts]: Start accepts. Automaton has 169732 states and 694021 transitions. Word has length 19 [2019-12-18 18:28:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:13,624 INFO L462 AbstractCegarLoop]: Abstraction has 169732 states and 694021 transitions. [2019-12-18 18:28:13,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:28:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 169732 states and 694021 transitions. [2019-12-18 18:28:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:28:13,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:13,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:28:13,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-18 18:28:13,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:13,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934102110] [2019-12-18 18:28:13,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934102110] [2019-12-18 18:28:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976329669] [2019-12-18 18:28:13,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:28:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:28:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:28:13,735 INFO L87 Difference]: Start difference. First operand 169732 states and 694021 transitions. Second operand 4 states. [2019-12-18 18:28:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:13,990 INFO L93 Difference]: Finished difference Result 49048 states and 168395 transitions. [2019-12-18 18:28:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:28:13,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:28:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:14,068 INFO L225 Difference]: With dead ends: 49048 [2019-12-18 18:28:14,069 INFO L226 Difference]: Without dead ends: 38053 [2019-12-18 18:28:14,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38053 states. [2019-12-18 18:28:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38053 to 37601. [2019-12-18 18:28:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37601 states. [2019-12-18 18:28:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37601 states to 37601 states and 124116 transitions. [2019-12-18 18:28:15,866 INFO L78 Accepts]: Start accepts. Automaton has 37601 states and 124116 transitions. Word has length 19 [2019-12-18 18:28:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:15,867 INFO L462 AbstractCegarLoop]: Abstraction has 37601 states and 124116 transitions. [2019-12-18 18:28:15,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:28:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37601 states and 124116 transitions. [2019-12-18 18:28:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:28:15,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:15,877 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] [2019-12-18 18:28:15,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-18 18:28:15,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:15,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912595755] [2019-12-18 18:28:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:15,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912595755] [2019-12-18 18:28:15,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:15,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:15,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404154027] [2019-12-18 18:28:15,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:15,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:15,954 INFO L87 Difference]: Start difference. First operand 37601 states and 124116 transitions. Second operand 5 states. [2019-12-18 18:28:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:16,557 INFO L93 Difference]: Finished difference Result 50439 states and 163679 transitions. [2019-12-18 18:28:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:28:16,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 18:28:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:16,656 INFO L225 Difference]: With dead ends: 50439 [2019-12-18 18:28:16,656 INFO L226 Difference]: Without dead ends: 50137 [2019-12-18 18:28:16,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50137 states. [2019-12-18 18:28:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50137 to 38325. [2019-12-18 18:28:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38325 states. [2019-12-18 18:28:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38325 states to 38325 states and 126442 transitions. [2019-12-18 18:28:19,862 INFO L78 Accepts]: Start accepts. Automaton has 38325 states and 126442 transitions. Word has length 22 [2019-12-18 18:28:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:19,863 INFO L462 AbstractCegarLoop]: Abstraction has 38325 states and 126442 transitions. [2019-12-18 18:28:19,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38325 states and 126442 transitions. [2019-12-18 18:28:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:28:19,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:19,870 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] [2019-12-18 18:28:19,870 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-18 18:28:19,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:19,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041563883] [2019-12-18 18:28:19,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:19,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041563883] [2019-12-18 18:28:19,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:19,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:19,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405132829] [2019-12-18 18:28:19,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:19,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:19,945 INFO L87 Difference]: Start difference. First operand 38325 states and 126442 transitions. Second operand 5 states. [2019-12-18 18:28:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:20,692 INFO L93 Difference]: Finished difference Result 50758 states and 164508 transitions. [2019-12-18 18:28:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:28:20,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 18:28:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:20,785 INFO L225 Difference]: With dead ends: 50758 [2019-12-18 18:28:20,785 INFO L226 Difference]: Without dead ends: 50338 [2019-12-18 18:28:20,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-18 18:28:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 35870. [2019-12-18 18:28:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35870 states. [2019-12-18 18:28:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35870 states to 35870 states and 118280 transitions. [2019-12-18 18:28:21,491 INFO L78 Accepts]: Start accepts. Automaton has 35870 states and 118280 transitions. Word has length 22 [2019-12-18 18:28:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:21,491 INFO L462 AbstractCegarLoop]: Abstraction has 35870 states and 118280 transitions. [2019-12-18 18:28:21,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 35870 states and 118280 transitions. [2019-12-18 18:28:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:28:21,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:21,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:28:21,503 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-18 18:28:21,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:21,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016470330] [2019-12-18 18:28:21,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:21,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016470330] [2019-12-18 18:28:21,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:21,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:21,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872461834] [2019-12-18 18:28:21,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:21,945 INFO L87 Difference]: Start difference. First operand 35870 states and 118280 transitions. Second operand 5 states. [2019-12-18 18:28:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:22,480 INFO L93 Difference]: Finished difference Result 49184 states and 158828 transitions. [2019-12-18 18:28:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:28:22,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:28:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:22,559 INFO L225 Difference]: With dead ends: 49184 [2019-12-18 18:28:22,559 INFO L226 Difference]: Without dead ends: 48744 [2019-12-18 18:28:22,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48744 states. [2019-12-18 18:28:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48744 to 39958. [2019-12-18 18:28:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-18 18:28:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 131043 transitions. [2019-12-18 18:28:23,325 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 131043 transitions. Word has length 25 [2019-12-18 18:28:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:23,325 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 131043 transitions. [2019-12-18 18:28:23,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 131043 transitions. [2019-12-18 18:28:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:28:23,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:23,344 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] [2019-12-18 18:28:23,344 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-18 18:28:23,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613189984] [2019-12-18 18:28:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:23,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613189984] [2019-12-18 18:28:23,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:23,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:23,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548751402] [2019-12-18 18:28:23,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:23,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:23,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:23,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:23,409 INFO L87 Difference]: Start difference. First operand 39958 states and 131043 transitions. Second operand 5 states. [2019-12-18 18:28:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:23,821 INFO L93 Difference]: Finished difference Result 50424 states and 163757 transitions. [2019-12-18 18:28:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:28:23,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 18:28:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:24,312 INFO L225 Difference]: With dead ends: 50424 [2019-12-18 18:28:24,313 INFO L226 Difference]: Without dead ends: 50050 [2019-12-18 18:28:24,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 18:28:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50050 states. [2019-12-18 18:28:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50050 to 41737. [2019-12-18 18:28:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41737 states. [2019-12-18 18:28:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41737 states to 41737 states and 136855 transitions. [2019-12-18 18:28:24,979 INFO L78 Accepts]: Start accepts. Automaton has 41737 states and 136855 transitions. Word has length 28 [2019-12-18 18:28:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:24,979 INFO L462 AbstractCegarLoop]: Abstraction has 41737 states and 136855 transitions. [2019-12-18 18:28:24,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41737 states and 136855 transitions. [2019-12-18 18:28:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:28:24,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:24,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:28:24,999 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-18 18:28:25,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:25,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422218101] [2019-12-18 18:28:25,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:25,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422218101] [2019-12-18 18:28:25,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:25,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:25,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691031322] [2019-12-18 18:28:25,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:28:25,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:25,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:28:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:25,047 INFO L87 Difference]: Start difference. First operand 41737 states and 136855 transitions. Second operand 3 states. [2019-12-18 18:28:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:25,249 INFO L93 Difference]: Finished difference Result 52983 states and 172445 transitions. [2019-12-18 18:28:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:28:25,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 18:28:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:25,333 INFO L225 Difference]: With dead ends: 52983 [2019-12-18 18:28:25,333 INFO L226 Difference]: Without dead ends: 52983 [2019-12-18 18:28:25,334 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-18 18:28:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52983 states. [2019-12-18 18:28:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52983 to 43481. [2019-12-18 18:28:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43481 states. [2019-12-18 18:28:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43481 states to 43481 states and 140263 transitions. [2019-12-18 18:28:26,410 INFO L78 Accepts]: Start accepts. Automaton has 43481 states and 140263 transitions. Word has length 28 [2019-12-18 18:28:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:26,410 INFO L462 AbstractCegarLoop]: Abstraction has 43481 states and 140263 transitions. [2019-12-18 18:28:26,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:28:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 43481 states and 140263 transitions. [2019-12-18 18:28:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 18:28:26,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:26,428 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] [2019-12-18 18:28:26,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-18 18:28:26,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:26,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009342595] [2019-12-18 18:28:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:26,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009342595] [2019-12-18 18:28:26,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:26,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714599154] [2019-12-18 18:28:26,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:26,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:26,491 INFO L87 Difference]: Start difference. First operand 43481 states and 140263 transitions. Second operand 5 states. [2019-12-18 18:28:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:26,955 INFO L93 Difference]: Finished difference Result 54179 states and 173086 transitions. [2019-12-18 18:28:26,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:28:26,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 18:28:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:27,052 INFO L225 Difference]: With dead ends: 54179 [2019-12-18 18:28:27,052 INFO L226 Difference]: Without dead ends: 53785 [2019-12-18 18:28:27,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 18:28:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53785 states. [2019-12-18 18:28:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53785 to 42787. [2019-12-18 18:28:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42787 states. [2019-12-18 18:28:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42787 states to 42787 states and 137824 transitions. [2019-12-18 18:28:28,174 INFO L78 Accepts]: Start accepts. Automaton has 42787 states and 137824 transitions. Word has length 29 [2019-12-18 18:28:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:28,174 INFO L462 AbstractCegarLoop]: Abstraction has 42787 states and 137824 transitions. [2019-12-18 18:28:28,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42787 states and 137824 transitions. [2019-12-18 18:28:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 18:28:28,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:28,192 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] [2019-12-18 18:28:28,192 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-18 18:28:28,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:28,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929277531] [2019-12-18 18:28:28,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:28,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929277531] [2019-12-18 18:28:28,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:28,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:28:28,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147164841] [2019-12-18 18:28:28,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:28:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:28:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:28,279 INFO L87 Difference]: Start difference. First operand 42787 states and 137824 transitions. Second operand 3 states. [2019-12-18 18:28:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:28,588 INFO L93 Difference]: Finished difference Result 62369 states and 203785 transitions. [2019-12-18 18:28:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:28:28,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 18:28:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:28,636 INFO L225 Difference]: With dead ends: 62369 [2019-12-18 18:28:28,637 INFO L226 Difference]: Without dead ends: 27708 [2019-12-18 18:28:28,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27708 states. [2019-12-18 18:28:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27708 to 26920. [2019-12-18 18:28:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26920 states. [2019-12-18 18:28:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26920 states to 26920 states and 86266 transitions. [2019-12-18 18:28:29,118 INFO L78 Accepts]: Start accepts. Automaton has 26920 states and 86266 transitions. Word has length 29 [2019-12-18 18:28:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:29,119 INFO L462 AbstractCegarLoop]: Abstraction has 26920 states and 86266 transitions. [2019-12-18 18:28:29,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:28:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26920 states and 86266 transitions. [2019-12-18 18:28:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 18:28:29,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:29,132 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] [2019-12-18 18:28:29,133 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-18 18:28:29,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:29,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443610653] [2019-12-18 18:28:29,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:29,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443610653] [2019-12-18 18:28:29,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:29,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:28:29,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568270337] [2019-12-18 18:28:29,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:28:29,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:28:29,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:28:29,175 INFO L87 Difference]: Start difference. First operand 26920 states and 86266 transitions. Second operand 4 states. [2019-12-18 18:28:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:29,373 INFO L93 Difference]: Finished difference Result 44120 states and 145060 transitions. [2019-12-18 18:28:29,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:28:29,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-18 18:28:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:29,412 INFO L225 Difference]: With dead ends: 44120 [2019-12-18 18:28:29,412 INFO L226 Difference]: Without dead ends: 21429 [2019-12-18 18:28:29,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-18 18:28:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-18 18:28:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-18 18:28:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-18 18:28:30,022 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 30 [2019-12-18 18:28:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:30,022 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-18 18:28:30,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:28:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-18 18:28:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 18:28:30,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:30,033 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] [2019-12-18 18:28:30,033 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-18 18:28:30,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:30,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669488134] [2019-12-18 18:28:30,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:30,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669488134] [2019-12-18 18:28:30,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:30,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:28:30,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026555019] [2019-12-18 18:28:30,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:30,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:30,096 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-18 18:28:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:30,690 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-18 18:28:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:28:30,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 18:28:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:30,747 INFO L225 Difference]: With dead ends: 34767 [2019-12-18 18:28:30,747 INFO L226 Difference]: Without dead ends: 34767 [2019-12-18 18:28:30,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:28:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-18 18:28:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-18 18:28:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-18 18:28:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-18 18:28:31,295 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-18 18:28:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:31,296 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-18 18:28:31,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-18 18:28:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 18:28:31,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:31,318 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] [2019-12-18 18:28:31,318 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-18 18:28:31,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:31,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661783097] [2019-12-18 18:28:31,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:31,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-18 18:28:31,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661783097] [2019-12-18 18:28:31,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:31,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:28:31,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908631968] [2019-12-18 18:28:31,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:28:31,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:28:31,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:28:31,396 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-18 18:28:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:31,498 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-18 18:28:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:28:31,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 18:28:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:31,515 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 18:28:31,515 INFO L226 Difference]: Without dead ends: 11110 [2019-12-18 18:28:31,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-18 18:28:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-18 18:28:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-18 18:28:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-18 18:28:31,698 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-18 18:28:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:31,698 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-18 18:28:31,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:28:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-18 18:28:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:28:31,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:31,709 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] [2019-12-18 18:28:31,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-18 18:28:31,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:31,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175477903] [2019-12-18 18:28:31,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:31,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175477903] [2019-12-18 18:28:31,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:31,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:28:31,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036806931] [2019-12-18 18:28:31,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:28:31,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:28:31,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:28:31,785 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-18 18:28:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:31,991 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-18 18:28:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:28:31,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 18:28:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:32,009 INFO L225 Difference]: With dead ends: 11069 [2019-12-18 18:28:32,009 INFO L226 Difference]: Without dead ends: 10842 [2019-12-18 18:28:32,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-18 18:28:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-18 18:28:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-18 18:28:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-18 18:28:32,241 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-18 18:28:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:32,242 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-18 18:28:32,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:28:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-18 18:28:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:28:32,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:32,254 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] [2019-12-18 18:28:32,254 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-18 18:28:32,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:32,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307929951] [2019-12-18 18:28:32,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:32,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307929951] [2019-12-18 18:28:32,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:32,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:28:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352264758] [2019-12-18 18:28:32,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:28:32,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:32,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:28:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:28:32,342 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-18 18:28:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:33,148 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-18 18:28:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:28:33,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 18:28:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:33,188 INFO L225 Difference]: With dead ends: 20964 [2019-12-18 18:28:33,188 INFO L226 Difference]: Without dead ends: 20964 [2019-12-18 18:28:33,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-18 18:28:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-18 18:28:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-18 18:28:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-18 18:28:33,449 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-18 18:28:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:33,449 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-18 18:28:33,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:28:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-18 18:28:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:28:33,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:33,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:28:33,463 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-18 18:28:33,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:33,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784791972] [2019-12-18 18:28:33,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:33,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784791972] [2019-12-18 18:28:33,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:33,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:28:33,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830174857] [2019-12-18 18:28:33,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:28:33,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:28:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:33,569 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 7 states. [2019-12-18 18:28:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:34,548 INFO L93 Difference]: Finished difference Result 23178 states and 68867 transitions. [2019-12-18 18:28:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:28:34,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 18:28:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:34,578 INFO L225 Difference]: With dead ends: 23178 [2019-12-18 18:28:34,579 INFO L226 Difference]: Without dead ends: 23178 [2019-12-18 18:28:34,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:28:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23178 states. [2019-12-18 18:28:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23178 to 13796. [2019-12-18 18:28:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-12-18 18:28:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 41573 transitions. [2019-12-18 18:28:34,821 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 41573 transitions. Word has length 40 [2019-12-18 18:28:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:34,821 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 41573 transitions. [2019-12-18 18:28:34,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:28:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 41573 transitions. [2019-12-18 18:28:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:28:34,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:34,834 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] [2019-12-18 18:28:34,834 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 3 times [2019-12-18 18:28:34,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:34,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958481604] [2019-12-18 18:28:34,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:34,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958481604] [2019-12-18 18:28:34,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:34,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:28:34,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832250403] [2019-12-18 18:28:34,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:28:34,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:28:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:28:34,915 INFO L87 Difference]: Start difference. First operand 13796 states and 41573 transitions. Second operand 6 states. [2019-12-18 18:28:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:35,032 INFO L93 Difference]: Finished difference Result 12729 states and 38811 transitions. [2019-12-18 18:28:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:28:35,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 18:28:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:35,050 INFO L225 Difference]: With dead ends: 12729 [2019-12-18 18:28:35,050 INFO L226 Difference]: Without dead ends: 12234 [2019-12-18 18:28:35,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2019-12-18 18:28:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 11301. [2019-12-18 18:28:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11301 states. [2019-12-18 18:28:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11301 states to 11301 states and 35160 transitions. [2019-12-18 18:28:35,217 INFO L78 Accepts]: Start accepts. Automaton has 11301 states and 35160 transitions. Word has length 40 [2019-12-18 18:28:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:35,217 INFO L462 AbstractCegarLoop]: Abstraction has 11301 states and 35160 transitions. [2019-12-18 18:28:35,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:28:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 11301 states and 35160 transitions. [2019-12-18 18:28:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:35,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:35,229 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] [2019-12-18 18:28:35,229 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1638387748, now seen corresponding path program 1 times [2019-12-18 18:28:35,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:35,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293761549] [2019-12-18 18:28:35,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:35,422 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 18:28:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:35,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293761549] [2019-12-18 18:28:35,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:35,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:28:35,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987662029] [2019-12-18 18:28:35,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:28:35,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:28:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:35,456 INFO L87 Difference]: Start difference. First operand 11301 states and 35160 transitions. Second operand 7 states. [2019-12-18 18:28:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:35,709 INFO L93 Difference]: Finished difference Result 19741 states and 60287 transitions. [2019-12-18 18:28:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:28:35,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:28:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:35,731 INFO L225 Difference]: With dead ends: 19741 [2019-12-18 18:28:35,731 INFO L226 Difference]: Without dead ends: 14183 [2019-12-18 18:28:35,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:28:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14183 states. [2019-12-18 18:28:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14183 to 13085. [2019-12-18 18:28:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13085 states. [2019-12-18 18:28:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13085 states to 13085 states and 40241 transitions. [2019-12-18 18:28:35,931 INFO L78 Accepts]: Start accepts. Automaton has 13085 states and 40241 transitions. Word has length 54 [2019-12-18 18:28:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:35,932 INFO L462 AbstractCegarLoop]: Abstraction has 13085 states and 40241 transitions. [2019-12-18 18:28:35,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:28:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13085 states and 40241 transitions. [2019-12-18 18:28:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:35,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:35,946 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] [2019-12-18 18:28:35,946 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash 341327716, now seen corresponding path program 2 times [2019-12-18 18:28:35,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:35,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952390678] [2019-12-18 18:28:35,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:36,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952390678] [2019-12-18 18:28:36,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:36,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:28:36,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216870683] [2019-12-18 18:28:36,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:28:36,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:28:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:36,027 INFO L87 Difference]: Start difference. First operand 13085 states and 40241 transitions. Second operand 7 states. [2019-12-18 18:28:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:36,394 INFO L93 Difference]: Finished difference Result 22524 states and 68043 transitions. [2019-12-18 18:28:36,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:28:36,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:28:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:36,436 INFO L225 Difference]: With dead ends: 22524 [2019-12-18 18:28:36,436 INFO L226 Difference]: Without dead ends: 16315 [2019-12-18 18:28:36,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:28:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16315 states. [2019-12-18 18:28:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16315 to 14997. [2019-12-18 18:28:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14997 states. [2019-12-18 18:28:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 45579 transitions. [2019-12-18 18:28:36,863 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 45579 transitions. Word has length 54 [2019-12-18 18:28:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:36,863 INFO L462 AbstractCegarLoop]: Abstraction has 14997 states and 45579 transitions. [2019-12-18 18:28:36,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:28:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 45579 transitions. [2019-12-18 18:28:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:36,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:36,884 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] [2019-12-18 18:28:36,884 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1312613832, now seen corresponding path program 3 times [2019-12-18 18:28:36,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:36,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319141911] [2019-12-18 18:28:36,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:36,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319141911] [2019-12-18 18:28:36,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:36,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:28:36,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175762385] [2019-12-18 18:28:36,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:28:36,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:28:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:28:36,964 INFO L87 Difference]: Start difference. First operand 14997 states and 45579 transitions. Second operand 8 states. [2019-12-18 18:28:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:37,621 INFO L93 Difference]: Finished difference Result 22838 states and 68075 transitions. [2019-12-18 18:28:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:28:37,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 18:28:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:37,659 INFO L225 Difference]: With dead ends: 22838 [2019-12-18 18:28:37,659 INFO L226 Difference]: Without dead ends: 20404 [2019-12-18 18:28:37,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:28:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2019-12-18 18:28:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 14946. [2019-12-18 18:28:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14946 states. [2019-12-18 18:28:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14946 states to 14946 states and 45349 transitions. [2019-12-18 18:28:37,961 INFO L78 Accepts]: Start accepts. Automaton has 14946 states and 45349 transitions. Word has length 54 [2019-12-18 18:28:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:37,961 INFO L462 AbstractCegarLoop]: Abstraction has 14946 states and 45349 transitions. [2019-12-18 18:28:37,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:28:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14946 states and 45349 transitions. [2019-12-18 18:28:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:37,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:37,978 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] [2019-12-18 18:28:37,978 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -515471290, now seen corresponding path program 4 times [2019-12-18 18:28:37,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:37,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984371455] [2019-12-18 18:28:37,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:38,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984371455] [2019-12-18 18:28:38,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:28:38,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223976934] [2019-12-18 18:28:38,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:28:38,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:28:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:38,071 INFO L87 Difference]: Start difference. First operand 14946 states and 45349 transitions. Second operand 9 states. [2019-12-18 18:28:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:39,160 INFO L93 Difference]: Finished difference Result 28385 states and 84493 transitions. [2019-12-18 18:28:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 18:28:39,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 18:28:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:39,204 INFO L225 Difference]: With dead ends: 28385 [2019-12-18 18:28:39,204 INFO L226 Difference]: Without dead ends: 26122 [2019-12-18 18:28:39,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:28:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26122 states. [2019-12-18 18:28:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26122 to 14763. [2019-12-18 18:28:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14763 states. [2019-12-18 18:28:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14763 states to 14763 states and 44802 transitions. [2019-12-18 18:28:39,638 INFO L78 Accepts]: Start accepts. Automaton has 14763 states and 44802 transitions. Word has length 54 [2019-12-18 18:28:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:39,638 INFO L462 AbstractCegarLoop]: Abstraction has 14763 states and 44802 transitions. [2019-12-18 18:28:39,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:28:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14763 states and 44802 transitions. [2019-12-18 18:28:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:39,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:39,654 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] [2019-12-18 18:28:39,654 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:39,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1875848116, now seen corresponding path program 5 times [2019-12-18 18:28:39,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:39,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467925449] [2019-12-18 18:28:39,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:39,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467925449] [2019-12-18 18:28:39,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:39,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:28:39,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234775139] [2019-12-18 18:28:39,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:28:39,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:28:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:39,745 INFO L87 Difference]: Start difference. First operand 14763 states and 44802 transitions. Second operand 9 states. [2019-12-18 18:28:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:40,777 INFO L93 Difference]: Finished difference Result 36925 states and 110169 transitions. [2019-12-18 18:28:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:28:40,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 18:28:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:40,825 INFO L225 Difference]: With dead ends: 36925 [2019-12-18 18:28:40,826 INFO L226 Difference]: Without dead ends: 34745 [2019-12-18 18:28:40,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:28:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34745 states. [2019-12-18 18:28:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34745 to 14784. [2019-12-18 18:28:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14784 states. [2019-12-18 18:28:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 44900 transitions. [2019-12-18 18:28:41,168 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 44900 transitions. Word has length 54 [2019-12-18 18:28:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:41,168 INFO L462 AbstractCegarLoop]: Abstraction has 14784 states and 44900 transitions. [2019-12-18 18:28:41,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:28:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 44900 transitions. [2019-12-18 18:28:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:41,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:41,184 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] [2019-12-18 18:28:41,184 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1898016224, now seen corresponding path program 6 times [2019-12-18 18:28:41,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:41,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913223952] [2019-12-18 18:28:41,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:41,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913223952] [2019-12-18 18:28:41,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:41,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:28:41,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455706600] [2019-12-18 18:28:41,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:28:41,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:28:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:28:41,270 INFO L87 Difference]: Start difference. First operand 14784 states and 44900 transitions. Second operand 7 states. [2019-12-18 18:28:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:42,125 INFO L93 Difference]: Finished difference Result 22842 states and 68753 transitions. [2019-12-18 18:28:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:28:42,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:28:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:42,156 INFO L225 Difference]: With dead ends: 22842 [2019-12-18 18:28:42,157 INFO L226 Difference]: Without dead ends: 22842 [2019-12-18 18:28:42,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:28:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22842 states. [2019-12-18 18:28:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22842 to 15421. [2019-12-18 18:28:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15421 states. [2019-12-18 18:28:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15421 states to 15421 states and 46685 transitions. [2019-12-18 18:28:42,563 INFO L78 Accepts]: Start accepts. Automaton has 15421 states and 46685 transitions. Word has length 54 [2019-12-18 18:28:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:42,564 INFO L462 AbstractCegarLoop]: Abstraction has 15421 states and 46685 transitions. [2019-12-18 18:28:42,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:28:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15421 states and 46685 transitions. [2019-12-18 18:28:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:42,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:42,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] [2019-12-18 18:28:42,580 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1164320748, now seen corresponding path program 7 times [2019-12-18 18:28:42,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:42,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025299289] [2019-12-18 18:28:42,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:42,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025299289] [2019-12-18 18:28:42,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:42,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:28:42,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435606939] [2019-12-18 18:28:42,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:28:42,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:28:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:28:42,650 INFO L87 Difference]: Start difference. First operand 15421 states and 46685 transitions. Second operand 6 states. [2019-12-18 18:28:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:43,212 INFO L93 Difference]: Finished difference Result 19237 states and 57203 transitions. [2019-12-18 18:28:43,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:28:43,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 18:28:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:43,241 INFO L225 Difference]: With dead ends: 19237 [2019-12-18 18:28:43,241 INFO L226 Difference]: Without dead ends: 19237 [2019-12-18 18:28:43,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:28:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2019-12-18 18:28:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 15584. [2019-12-18 18:28:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15584 states. [2019-12-18 18:28:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15584 states to 15584 states and 47155 transitions. [2019-12-18 18:28:43,496 INFO L78 Accepts]: Start accepts. Automaton has 15584 states and 47155 transitions. Word has length 54 [2019-12-18 18:28:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:43,496 INFO L462 AbstractCegarLoop]: Abstraction has 15584 states and 47155 transitions. [2019-12-18 18:28:43,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:28:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15584 states and 47155 transitions. [2019-12-18 18:28:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:28:43,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:43,513 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] [2019-12-18 18:28:43,513 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -214722876, now seen corresponding path program 8 times [2019-12-18 18:28:43,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:43,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094846975] [2019-12-18 18:28:43,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:43,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094846975] [2019-12-18 18:28:43,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:43,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:28:43,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66034574] [2019-12-18 18:28:43,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:28:43,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:28:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:43,567 INFO L87 Difference]: Start difference. First operand 15584 states and 47155 transitions. Second operand 3 states. [2019-12-18 18:28:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:43,614 INFO L93 Difference]: Finished difference Result 9734 states and 29281 transitions. [2019-12-18 18:28:43,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:28:43,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:28:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:43,631 INFO L225 Difference]: With dead ends: 9734 [2019-12-18 18:28:43,631 INFO L226 Difference]: Without dead ends: 9734 [2019-12-18 18:28:43,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-12-18 18:28:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9626. [2019-12-18 18:28:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9626 states. [2019-12-18 18:28:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 28987 transitions. [2019-12-18 18:28:43,790 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 28987 transitions. Word has length 54 [2019-12-18 18:28:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:43,790 INFO L462 AbstractCegarLoop]: Abstraction has 9626 states and 28987 transitions. [2019-12-18 18:28:43,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:28:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 28987 transitions. [2019-12-18 18:28:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:28:43,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:43,800 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] [2019-12-18 18:28:43,800 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1879967444, now seen corresponding path program 1 times [2019-12-18 18:28:43,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:43,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701516396] [2019-12-18 18:28:43,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:43,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701516396] [2019-12-18 18:28:43,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:43,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:28:43,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057188792] [2019-12-18 18:28:43,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:28:43,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:28:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:43,902 INFO L87 Difference]: Start difference. First operand 9626 states and 28987 transitions. Second operand 9 states. [2019-12-18 18:28:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:44,929 INFO L93 Difference]: Finished difference Result 15983 states and 47457 transitions. [2019-12-18 18:28:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:28:44,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 18:28:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:44,948 INFO L225 Difference]: With dead ends: 15983 [2019-12-18 18:28:44,948 INFO L226 Difference]: Without dead ends: 11214 [2019-12-18 18:28:44,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:28:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2019-12-18 18:28:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 9938. [2019-12-18 18:28:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9938 states. [2019-12-18 18:28:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9938 states to 9938 states and 29548 transitions. [2019-12-18 18:28:45,142 INFO L78 Accepts]: Start accepts. Automaton has 9938 states and 29548 transitions. Word has length 55 [2019-12-18 18:28:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:45,142 INFO L462 AbstractCegarLoop]: Abstraction has 9938 states and 29548 transitions. [2019-12-18 18:28:45,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:28:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9938 states and 29548 transitions. [2019-12-18 18:28:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:28:45,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:45,153 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] [2019-12-18 18:28:45,153 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1331122226, now seen corresponding path program 2 times [2019-12-18 18:28:45,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:45,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089562744] [2019-12-18 18:28:45,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089562744] [2019-12-18 18:28:45,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:45,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:28:45,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474629619] [2019-12-18 18:28:45,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:28:45,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:28:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:28:45,273 INFO L87 Difference]: Start difference. First operand 9938 states and 29548 transitions. Second operand 9 states. [2019-12-18 18:28:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:46,250 INFO L93 Difference]: Finished difference Result 16925 states and 49031 transitions. [2019-12-18 18:28:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:28:46,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 18:28:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:46,274 INFO L225 Difference]: With dead ends: 16925 [2019-12-18 18:28:46,274 INFO L226 Difference]: Without dead ends: 16805 [2019-12-18 18:28:46,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:28:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2019-12-18 18:28:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 11806. [2019-12-18 18:28:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11806 states. [2019-12-18 18:28:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11806 states to 11806 states and 34831 transitions. [2019-12-18 18:28:46,590 INFO L78 Accepts]: Start accepts. Automaton has 11806 states and 34831 transitions. Word has length 55 [2019-12-18 18:28:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:46,591 INFO L462 AbstractCegarLoop]: Abstraction has 11806 states and 34831 transitions. [2019-12-18 18:28:46,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:28:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 11806 states and 34831 transitions. [2019-12-18 18:28:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:28:46,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:46,604 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] [2019-12-18 18:28:46,604 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1675553042, now seen corresponding path program 3 times [2019-12-18 18:28:46,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:46,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516184927] [2019-12-18 18:28:46,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:46,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516184927] [2019-12-18 18:28:46,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:46,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:28:46,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093177937] [2019-12-18 18:28:46,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:28:46,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:28:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:46,661 INFO L87 Difference]: Start difference. First operand 11806 states and 34831 transitions. Second operand 3 states. [2019-12-18 18:28:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:46,712 INFO L93 Difference]: Finished difference Result 11804 states and 34826 transitions. [2019-12-18 18:28:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:28:46,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:28:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:46,734 INFO L225 Difference]: With dead ends: 11804 [2019-12-18 18:28:46,734 INFO L226 Difference]: Without dead ends: 11804 [2019-12-18 18:28:46,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:28:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2019-12-18 18:28:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 9897. [2019-12-18 18:28:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9897 states. [2019-12-18 18:28:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9897 states to 9897 states and 29628 transitions. [2019-12-18 18:28:46,894 INFO L78 Accepts]: Start accepts. Automaton has 9897 states and 29628 transitions. Word has length 55 [2019-12-18 18:28:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:46,894 INFO L462 AbstractCegarLoop]: Abstraction has 9897 states and 29628 transitions. [2019-12-18 18:28:46,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:28:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 29628 transitions. [2019-12-18 18:28:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:28:46,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:46,905 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] [2019-12-18 18:28:46,905 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 1 times [2019-12-18 18:28:46,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:46,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546981062] [2019-12-18 18:28:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:47,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546981062] [2019-12-18 18:28:47,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:47,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:28:47,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837132301] [2019-12-18 18:28:47,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:28:47,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:28:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:28:47,264 INFO L87 Difference]: Start difference. First operand 9897 states and 29628 transitions. Second operand 15 states. [2019-12-18 18:28:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:49,790 INFO L93 Difference]: Finished difference Result 14687 states and 43124 transitions. [2019-12-18 18:28:49,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 18:28:49,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 18:28:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:49,811 INFO L225 Difference]: With dead ends: 14687 [2019-12-18 18:28:49,812 INFO L226 Difference]: Without dead ends: 14433 [2019-12-18 18:28:49,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=1824, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 18:28:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14433 states. [2019-12-18 18:28:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14433 to 12163. [2019-12-18 18:28:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12163 states. [2019-12-18 18:28:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12163 states to 12163 states and 36085 transitions. [2019-12-18 18:28:49,985 INFO L78 Accepts]: Start accepts. Automaton has 12163 states and 36085 transitions. Word has length 56 [2019-12-18 18:28:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:49,985 INFO L462 AbstractCegarLoop]: Abstraction has 12163 states and 36085 transitions. [2019-12-18 18:28:49,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:28:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 12163 states and 36085 transitions. [2019-12-18 18:28:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:28:49,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:49,996 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] [2019-12-18 18:28:49,997 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2122420018, now seen corresponding path program 2 times [2019-12-18 18:28:49,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:49,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324633121] [2019-12-18 18:28:49,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:50,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324633121] [2019-12-18 18:28:50,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:50,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:28:50,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345667059] [2019-12-18 18:28:50,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:28:50,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:28:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:28:50,380 INFO L87 Difference]: Start difference. First operand 12163 states and 36085 transitions. Second operand 15 states. [2019-12-18 18:28:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:52,857 INFO L93 Difference]: Finished difference Result 14749 states and 42944 transitions. [2019-12-18 18:28:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 18:28:52,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 18:28:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:52,874 INFO L225 Difference]: With dead ends: 14749 [2019-12-18 18:28:52,874 INFO L226 Difference]: Without dead ends: 12261 [2019-12-18 18:28:52,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 18:28:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12261 states. [2019-12-18 18:28:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12261 to 9977. [2019-12-18 18:28:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9977 states. [2019-12-18 18:28:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9977 states to 9977 states and 29732 transitions. [2019-12-18 18:28:53,019 INFO L78 Accepts]: Start accepts. Automaton has 9977 states and 29732 transitions. Word has length 56 [2019-12-18 18:28:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:53,019 INFO L462 AbstractCegarLoop]: Abstraction has 9977 states and 29732 transitions. [2019-12-18 18:28:53,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:28:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9977 states and 29732 transitions. [2019-12-18 18:28:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:28:53,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:53,030 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] [2019-12-18 18:28:53,030 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1452871878, now seen corresponding path program 3 times [2019-12-18 18:28:53,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:53,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039857000] [2019-12-18 18:28:53,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:53,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039857000] [2019-12-18 18:28:53,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:53,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:28:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008209323] [2019-12-18 18:28:53,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:28:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:28:53,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:28:53,506 INFO L87 Difference]: Start difference. First operand 9977 states and 29732 transitions. Second operand 16 states. [2019-12-18 18:28:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:28:56,764 INFO L93 Difference]: Finished difference Result 14127 states and 41500 transitions. [2019-12-18 18:28:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:28:56,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:28:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:28:56,783 INFO L225 Difference]: With dead ends: 14127 [2019-12-18 18:28:56,784 INFO L226 Difference]: Without dead ends: 13793 [2019-12-18 18:28:56,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 18:28:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13793 states. [2019-12-18 18:28:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13793 to 11446. [2019-12-18 18:28:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11446 states. [2019-12-18 18:28:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11446 states to 11446 states and 33986 transitions. [2019-12-18 18:28:56,977 INFO L78 Accepts]: Start accepts. Automaton has 11446 states and 33986 transitions. Word has length 56 [2019-12-18 18:28:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:28:56,977 INFO L462 AbstractCegarLoop]: Abstraction has 11446 states and 33986 transitions. [2019-12-18 18:28:56,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:28:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11446 states and 33986 transitions. [2019-12-18 18:28:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:28:56,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:28:56,990 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] [2019-12-18 18:28:56,991 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:28:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:28:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash -355930136, now seen corresponding path program 4 times [2019-12-18 18:28:56,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:28:56,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77453590] [2019-12-18 18:28:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:28:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:28:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:28:57,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77453590] [2019-12-18 18:28:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:28:57,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:28:57,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240724392] [2019-12-18 18:28:57,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:28:57,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:28:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:28:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:28:57,379 INFO L87 Difference]: Start difference. First operand 11446 states and 33986 transitions. Second operand 16 states. [2019-12-18 18:29:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:29:00,774 INFO L93 Difference]: Finished difference Result 14074 states and 40977 transitions. [2019-12-18 18:29:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:29:00,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:29:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:29:00,792 INFO L225 Difference]: With dead ends: 14074 [2019-12-18 18:29:00,792 INFO L226 Difference]: Without dead ends: 11850 [2019-12-18 18:29:00,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=459, Invalid=2297, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 18:29:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-12-18 18:29:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 9583. [2019-12-18 18:29:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9583 states. [2019-12-18 18:29:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9583 states to 9583 states and 28708 transitions. [2019-12-18 18:29:00,942 INFO L78 Accepts]: Start accepts. Automaton has 9583 states and 28708 transitions. Word has length 56 [2019-12-18 18:29:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:29:00,943 INFO L462 AbstractCegarLoop]: Abstraction has 9583 states and 28708 transitions. [2019-12-18 18:29:00,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:29:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9583 states and 28708 transitions. [2019-12-18 18:29:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:29:00,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:29:00,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:29:00,953 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:29:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:29:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash 388120898, now seen corresponding path program 5 times [2019-12-18 18:29:00,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:29:00,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733047659] [2019-12-18 18:29:00,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:29:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:29:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:29:01,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733047659] [2019-12-18 18:29:01,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:29:01,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:29:01,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366025586] [2019-12-18 18:29:01,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:29:01,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:29:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:29:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:29:01,425 INFO L87 Difference]: Start difference. First operand 9583 states and 28708 transitions. Second operand 16 states. [2019-12-18 18:29:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:29:03,376 INFO L93 Difference]: Finished difference Result 12404 states and 36747 transitions. [2019-12-18 18:29:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 18:29:03,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:29:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:29:03,396 INFO L225 Difference]: With dead ends: 12404 [2019-12-18 18:29:03,396 INFO L226 Difference]: Without dead ends: 12238 [2019-12-18 18:29:03,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 18:29:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12238 states. [2019-12-18 18:29:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12238 to 11032. [2019-12-18 18:29:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11032 states. [2019-12-18 18:29:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11032 states to 11032 states and 32890 transitions. [2019-12-18 18:29:03,571 INFO L78 Accepts]: Start accepts. Automaton has 11032 states and 32890 transitions. Word has length 56 [2019-12-18 18:29:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:29:03,571 INFO L462 AbstractCegarLoop]: Abstraction has 11032 states and 32890 transitions. [2019-12-18 18:29:03,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:29:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11032 states and 32890 transitions. [2019-12-18 18:29:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:29:03,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:29:03,584 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] [2019-12-18 18:29:03,584 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:29:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:29:03,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2085383710, now seen corresponding path program 6 times [2019-12-18 18:29:03,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:29:03,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074883384] [2019-12-18 18:29:03,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:29:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:29:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:29:03,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074883384] [2019-12-18 18:29:03,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:29:03,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:29:03,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158118375] [2019-12-18 18:29:03,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:29:03,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:29:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:29:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:29:03,957 INFO L87 Difference]: Start difference. First operand 11032 states and 32890 transitions. Second operand 16 states. Received shutdown request... [2019-12-18 18:29:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:29:05,790 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 18:29:05,795 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 18:29:05,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:29:05 BasicIcfg [2019-12-18 18:29:05,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:29:05,797 INFO L168 Benchmark]: Toolchain (without parser) took 194497.03 ms. Allocated memory was 143.1 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.0 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 624.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,797 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 143.1 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 18:29:05,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.15 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 97.6 MB in the beginning and 155.2 MB in the end (delta: -57.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.68 ms. Allocated memory is still 200.8 MB. Free memory was 154.2 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,798 INFO L168 Benchmark]: Boogie Preprocessor took 43.54 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,798 INFO L168 Benchmark]: RCFGBuilder took 845.02 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 103.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,799 INFO L168 Benchmark]: TraceAbstraction took 192772.09 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 570.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:29:05,801 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.29 ms. Allocated memory is still 143.1 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.15 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 97.6 MB in the beginning and 155.2 MB in the end (delta: -57.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.68 ms. Allocated memory is still 200.8 MB. Free memory was 154.2 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.54 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.02 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 103.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192772.09 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 570.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (11032states) and FLOYD_HOARE automaton (currently 30 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (12445 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (11032states) and FLOYD_HOARE automaton (currently 30 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (12445 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.5s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 78.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6797 SDtfs, 11741 SDslu, 21659 SDs, 0 SdLazy, 19055 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 62 SyntacticMatches, 32 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169732occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 270527 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1456 ConstructedInterpolants, 0 QuantifiedInterpolants, 323394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown