/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:05:43,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:05:43,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:05:44,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:05:44,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:05:44,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:05:44,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:05:44,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:05:44,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:05:44,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:05:44,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:05:44,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:05:44,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:05:44,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:05:44,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:05:44,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:05:44,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:05:44,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:05:44,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:05:44,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:05:44,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:05:44,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:05:44,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:05:44,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:05:44,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:05:44,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:05:44,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:05:44,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:05:44,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:05:44,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:05:44,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:05:44,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:05:44,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:05:44,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:05:44,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:05:44,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:05:44,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:05:44,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:05:44,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:05:44,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:05:44,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:05:44,088 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-MCR.epf [2019-12-27 18:05:44,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:05:44,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:05:44,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:05:44,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:05:44,105 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:05:44,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:05:44,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:05:44,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:05:44,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:05:44,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:05:44,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:05:44,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:05:44,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:05:44,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:05:44,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:05:44,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:05:44,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:05:44,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:05:44,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:05:44,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:05:44,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:05:44,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:05:44,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:05:44,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:05:44,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:05:44,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:05:44,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:05:44,111 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:05:44,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:05:44,111 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:05:44,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:05:44,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:05:44,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:05:44,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:05:44,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:05:44,446 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:05:44,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-27 18:05:44,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a37cde0/5ef99e4725b242f6aac620546a7e8087/FLAGb44728bb3 [2019-12-27 18:05:45,068 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:05:45,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-27 18:05:45,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a37cde0/5ef99e4725b242f6aac620546a7e8087/FLAGb44728bb3 [2019-12-27 18:05:45,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a37cde0/5ef99e4725b242f6aac620546a7e8087 [2019-12-27 18:05:45,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:05:45,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:05:45,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:05:45,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:05:45,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:05:45,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:45" (1/1) ... [2019-12-27 18:05:45,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:45, skipping insertion in model container [2019-12-27 18:05:45,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:45" (1/1) ... [2019-12-27 18:05:45,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:05:45,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:05:46,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:05:46,048 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:05:46,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:05:46,207 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:05:46,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46 WrapperNode [2019-12-27 18:05:46,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:05:46,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:05:46,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:05:46,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:05:46,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:05:46,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:05:46,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:05:46,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:05:46,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (1/1) ... [2019-12-27 18:05:46,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:05:46,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:05:46,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:05:46,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:05:46,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (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-27 18:05:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:05:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:05:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:05:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:05:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:05:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:05:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:05:46,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:05:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:05:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:05:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:05:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:05:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:05:46,411 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:05:47,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:05:47,192 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:05:47,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:47 BoogieIcfgContainer [2019-12-27 18:05:47,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:05:47,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:05:47,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:05:47,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:05:47,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:05:45" (1/3) ... [2019-12-27 18:05:47,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b182ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:47, skipping insertion in model container [2019-12-27 18:05:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:46" (2/3) ... [2019-12-27 18:05:47,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b182ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:47, skipping insertion in model container [2019-12-27 18:05:47,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:47" (3/3) ... [2019-12-27 18:05:47,207 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc.i [2019-12-27 18:05:47,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:05:47,221 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:05:47,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:05:47,235 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:05:47,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,343 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,343 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,358 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:47,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:05:47,403 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:05:47,403 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:05:47,403 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:05:47,403 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:05:47,403 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:05:47,403 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:05:47,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:05:47,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:05:47,419 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:05:47,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:05:47,522 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:05:47,522 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:05:47,540 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. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:05:47,566 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:05:47,618 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:05:47,619 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:05:47,626 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. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:05:47,646 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:05:47,647 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:05:53,404 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:05:53,517 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:05:53,651 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-27 18:05:53,652 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:05:53,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:06:05,815 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:06:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:06:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:06:05,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:05,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:06:05,826 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-27 18:06:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-27 18:06:05,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:05,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970328207] [2019-12-27 18:06:05,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:06,128 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-27 18:06:06,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970328207] [2019-12-27 18:06:06,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:06,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:06:06,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030112742] [2019-12-27 18:06:06,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:06,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:06,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:06:06,155 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:06,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:06,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:06:06,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:06:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:06:06,180 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:06:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:07,546 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:06:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:07,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:06:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:10,756 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:06:10,757 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:06:10,758 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-27 18:06:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:06:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:06:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:06:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:06:19,376 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:06:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:19,377 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:06:19,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:06:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:06:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:06:19,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:19,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:19,388 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-27 18:06:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-27 18:06:19,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:19,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101783409] [2019-12-27 18:06:19,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:19,495 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-27 18:06:19,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101783409] [2019-12-27 18:06:19,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:19,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:19,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466245446] [2019-12-27 18:06:19,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:19,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:19,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:06:19,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:19,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:19,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:06:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:06:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:06:19,507 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:06:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:20,502 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:06:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:20,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:06:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:24,890 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:06:24,890 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:06:24,891 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-27 18:06:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:06:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:06:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:06:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:06:31,949 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:06:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:31,950 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:06:31,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:06:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:06:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:06:31,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:31,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:31,953 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-27 18:06:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-27 18:06:31,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:31,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245587267] [2019-12-27 18:06:31,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:32,027 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-27 18:06:32,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245587267] [2019-12-27 18:06:32,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:32,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:32,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323922668] [2019-12-27 18:06:32,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:32,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:32,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:06:32,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:32,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:32,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:06:32,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:06:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:06:32,034 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:06:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:38,060 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:06:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:38,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:06:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:38,609 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:06:38,609 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:06:38,609 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-27 18:06:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:06:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:06:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:06:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:06:45,503 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:06:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:45,503 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:06:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:06:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:06:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:06:45,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:45,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:45,508 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-27 18:06:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-27 18:06:45,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:45,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725123343] [2019-12-27 18:06:45,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:45,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-27 18:06:45,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725123343] [2019-12-27 18:06:45,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:06:45,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1502539068] [2019-12-27 18:06:45,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:45,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:45,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:06:45,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:45,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:06:45,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:06:45,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:06:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:45,621 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:06:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:52,185 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:06:52,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:52,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:06:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:52,763 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:06:52,763 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:06:52,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:06:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:06:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:07:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:07:00,290 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:07:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:00,290 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:07:00,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:07:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:00,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:00,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:00,294 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-27 18:07:00,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-27 18:07:00,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:00,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065926024] [2019-12-27 18:07:00,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:00,361 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-27 18:07:00,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065926024] [2019-12-27 18:07:00,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:00,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:00,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818753484] [2019-12-27 18:07:00,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:00,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:00,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:00,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:00,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:00,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:00,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:00,387 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:07:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:02,791 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:07:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:02,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:03,329 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:07:03,329 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:07:03,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:07:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:07:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:07:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:07:17,586 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:07:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:17,587 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:07:17,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:07:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:17,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:17,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:17,590 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-27 18:07:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-27 18:07:17,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:17,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840755735] [2019-12-27 18:07:17,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:17,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840755735] [2019-12-27 18:07:17,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:17,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:17,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308212137] [2019-12-27 18:07:17,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:17,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:17,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:17,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:17,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:17,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:17,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:17,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:17,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:17,691 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:07:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:18,908 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:07:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:18,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:26,067 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:07:26,068 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:07:26,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:07:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:07:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:07:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:07:33,411 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:07:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:33,411 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:07:33,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:07:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:07:33,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:33,430 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-27 18:07:33,430 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-27 18:07:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-27 18:07:33,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:33,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370043249] [2019-12-27 18:07:33,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:33,473 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-27 18:07:33,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370043249] [2019-12-27 18:07:33,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:33,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:07:33,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [652406309] [2019-12-27 18:07:33,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:33,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:33,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:07:33,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:33,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:33,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:07:33,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:07:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:07:33,482 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:07:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:35,374 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:07:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:07:35,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:07:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:35,844 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:07:35,845 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:07:35,845 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-27 18:07:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:07:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:07:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:07:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:07:49,226 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:07:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:49,226 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:07:49,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:07:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:07:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:07:49,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:49,246 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-27 18:07:49,246 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-27 18:07:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-27 18:07:49,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:49,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873855269] [2019-12-27 18:07:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:49,292 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-27 18:07:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873855269] [2019-12-27 18:07:49,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:49,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:49,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866897362] [2019-12-27 18:07:49,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:49,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:49,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:07:49,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:49,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:07:49,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:49,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:49,317 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:07:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:57,692 INFO L93 Difference]: Finished difference Result 383501 states and 1595297 transitions. [2019-12-27 18:07:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:57,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:07:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:59,271 INFO L225 Difference]: With dead ends: 383501 [2019-12-27 18:07:59,271 INFO L226 Difference]: Without dead ends: 256533 [2019-12-27 18:07:59,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256533 states. [2019-12-27 18:08:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256533 to 171713. [2019-12-27 18:08:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171713 states. [2019-12-27 18:08:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171713 states to 171713 states and 702115 transitions. [2019-12-27 18:08:13,621 INFO L78 Accepts]: Start accepts. Automaton has 171713 states and 702115 transitions. Word has length 19 [2019-12-27 18:08:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:13,621 INFO L462 AbstractCegarLoop]: Abstraction has 171713 states and 702115 transitions. [2019-12-27 18:08:13,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 171713 states and 702115 transitions. [2019-12-27 18:08:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:08:13,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:13,640 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-27 18:08:13,641 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-27 18:08:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-27 18:08:13,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:13,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783148862] [2019-12-27 18:08:13,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:13,720 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-27 18:08:13,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783148862] [2019-12-27 18:08:13,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:13,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:13,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170027674] [2019-12-27 18:08:13,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:13,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:13,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:08:13,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:13,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:08:13,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:13,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:13,767 INFO L87 Difference]: Start difference. First operand 171713 states and 702115 transitions. Second operand 5 states. [2019-12-27 18:08:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:14,186 INFO L93 Difference]: Finished difference Result 52005 states and 178102 transitions. [2019-12-27 18:08:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:14,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:08:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:14,265 INFO L225 Difference]: With dead ends: 52005 [2019-12-27 18:08:14,265 INFO L226 Difference]: Without dead ends: 41010 [2019-12-27 18:08:14,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41010 states. [2019-12-27 18:08:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41010 to 37941. [2019-12-27 18:08:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37941 states. [2019-12-27 18:08:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37941 states to 37941 states and 125252 transitions. [2019-12-27 18:08:20,540 INFO L78 Accepts]: Start accepts. Automaton has 37941 states and 125252 transitions. Word has length 19 [2019-12-27 18:08:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:20,540 INFO L462 AbstractCegarLoop]: Abstraction has 37941 states and 125252 transitions. [2019-12-27 18:08:20,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 37941 states and 125252 transitions. [2019-12-27 18:08:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:08:20,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:20,547 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-27 18:08:20,548 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-27 18:08:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-27 18:08:20,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:20,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423513199] [2019-12-27 18:08:20,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:20,600 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-27 18:08:20,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423513199] [2019-12-27 18:08:20,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:20,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:20,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223380016] [2019-12-27 18:08:20,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:20,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:20,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 18:08:20,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:20,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:20,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:20,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:20,617 INFO L87 Difference]: Start difference. First operand 37941 states and 125252 transitions. Second operand 5 states. [2019-12-27 18:08:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:21,183 INFO L93 Difference]: Finished difference Result 50773 states and 164800 transitions. [2019-12-27 18:08:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:08:21,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 18:08:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:21,275 INFO L225 Difference]: With dead ends: 50773 [2019-12-27 18:08:21,276 INFO L226 Difference]: Without dead ends: 50471 [2019-12-27 18:08:21,276 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-27 18:08:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50471 states. [2019-12-27 18:08:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50471 to 38659. [2019-12-27 18:08:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38659 states. [2019-12-27 18:08:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38659 states to 38659 states and 127563 transitions. [2019-12-27 18:08:22,003 INFO L78 Accepts]: Start accepts. Automaton has 38659 states and 127563 transitions. Word has length 22 [2019-12-27 18:08:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:22,004 INFO L462 AbstractCegarLoop]: Abstraction has 38659 states and 127563 transitions. [2019-12-27 18:08:22,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 38659 states and 127563 transitions. [2019-12-27 18:08:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:08:22,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:22,011 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-27 18:08:22,011 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-27 18:08:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-27 18:08:22,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:22,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516723599] [2019-12-27 18:08:22,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:22,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516723599] [2019-12-27 18:08:22,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:22,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:22,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639347601] [2019-12-27 18:08:22,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:22,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:22,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:08:22,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:22,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:22,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:22,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:22,182 INFO L87 Difference]: Start difference. First operand 38659 states and 127563 transitions. Second operand 6 states. [2019-12-27 18:08:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:23,388 INFO L93 Difference]: Finished difference Result 75469 states and 247696 transitions. [2019-12-27 18:08:23,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:08:23,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:08:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:23,529 INFO L225 Difference]: With dead ends: 75469 [2019-12-27 18:08:23,529 INFO L226 Difference]: Without dead ends: 75049 [2019-12-27 18:08:23,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75049 states. [2019-12-27 18:08:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75049 to 36650. [2019-12-27 18:08:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36650 states. [2019-12-27 18:08:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36650 states to 36650 states and 120885 transitions. [2019-12-27 18:08:24,413 INFO L78 Accepts]: Start accepts. Automaton has 36650 states and 120885 transitions. Word has length 22 [2019-12-27 18:08:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:24,413 INFO L462 AbstractCegarLoop]: Abstraction has 36650 states and 120885 transitions. [2019-12-27 18:08:24,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 36650 states and 120885 transitions. [2019-12-27 18:08:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:08:24,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:24,425 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-27 18:08:24,425 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-27 18:08:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-27 18:08:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:24,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305650173] [2019-12-27 18:08:24,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:24,512 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-27 18:08:24,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305650173] [2019-12-27 18:08:24,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:24,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:24,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912714066] [2019-12-27 18:08:24,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:24,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:24,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:08:24,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:24,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:24,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:24,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:24,524 INFO L87 Difference]: Start difference. First operand 36650 states and 120885 transitions. Second operand 5 states. [2019-12-27 18:08:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:25,471 INFO L93 Difference]: Finished difference Result 50791 states and 163979 transitions. [2019-12-27 18:08:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:25,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:08:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:25,623 INFO L225 Difference]: With dead ends: 50791 [2019-12-27 18:08:25,623 INFO L226 Difference]: Without dead ends: 50351 [2019-12-27 18:08:25,623 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-27 18:08:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50351 states. [2019-12-27 18:08:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50351 to 41268. [2019-12-27 18:08:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41268 states. [2019-12-27 18:08:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41268 states to 41268 states and 135281 transitions. [2019-12-27 18:08:26,446 INFO L78 Accepts]: Start accepts. Automaton has 41268 states and 135281 transitions. Word has length 25 [2019-12-27 18:08:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:26,447 INFO L462 AbstractCegarLoop]: Abstraction has 41268 states and 135281 transitions. [2019-12-27 18:08:26,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 41268 states and 135281 transitions. [2019-12-27 18:08:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:08:26,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:26,465 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-27 18:08:26,465 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-27 18:08:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-27 18:08:26,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:26,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069420846] [2019-12-27 18:08:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:26,522 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-27 18:08:26,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069420846] [2019-12-27 18:08:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:26,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140167321] [2019-12-27 18:08:26,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:26,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:26,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:08:26,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:26,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:26,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:26,589 INFO L87 Difference]: Start difference. First operand 41268 states and 135281 transitions. Second operand 7 states. [2019-12-27 18:08:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:27,057 INFO L93 Difference]: Finished difference Result 51734 states and 167995 transitions. [2019-12-27 18:08:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:27,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:08:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:27,146 INFO L225 Difference]: With dead ends: 51734 [2019-12-27 18:08:27,147 INFO L226 Difference]: Without dead ends: 51360 [2019-12-27 18:08:27,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51360 states. [2019-12-27 18:08:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51360 to 43047. [2019-12-27 18:08:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2019-12-27 18:08:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 141093 transitions. [2019-12-27 18:08:28,179 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 141093 transitions. Word has length 28 [2019-12-27 18:08:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:28,179 INFO L462 AbstractCegarLoop]: Abstraction has 43047 states and 141093 transitions. [2019-12-27 18:08:28,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 141093 transitions. [2019-12-27 18:08:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:08:28,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:28,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:28,202 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-27 18:08:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-27 18:08:28,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:28,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589956018] [2019-12-27 18:08:28,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:28,236 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-27 18:08:28,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589956018] [2019-12-27 18:08:28,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:28,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:28,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174748253] [2019-12-27 18:08:28,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:28,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:28,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:08:28,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:28,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:28,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:28,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:28,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:28,344 INFO L87 Difference]: Start difference. First operand 43047 states and 141093 transitions. Second operand 7 states. [2019-12-27 18:08:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:28,590 INFO L93 Difference]: Finished difference Result 54015 states and 175600 transitions. [2019-12-27 18:08:28,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:28,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:08:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:28,688 INFO L225 Difference]: With dead ends: 54015 [2019-12-27 18:08:28,688 INFO L226 Difference]: Without dead ends: 54015 [2019-12-27 18:08:28,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54015 states. [2019-12-27 18:08:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54015 to 44513. [2019-12-27 18:08:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44513 states. [2019-12-27 18:08:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44513 states to 44513 states and 143418 transitions. [2019-12-27 18:08:29,772 INFO L78 Accepts]: Start accepts. Automaton has 44513 states and 143418 transitions. Word has length 28 [2019-12-27 18:08:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:29,772 INFO L462 AbstractCegarLoop]: Abstraction has 44513 states and 143418 transitions. [2019-12-27 18:08:29,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 44513 states and 143418 transitions. [2019-12-27 18:08:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:08:29,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:29,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:29,789 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-27 18:08:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-27 18:08:29,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:29,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449067456] [2019-12-27 18:08:29,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:29,842 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-27 18:08:29,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449067456] [2019-12-27 18:08:29,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:29,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:29,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937805808] [2019-12-27 18:08:29,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:29,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:29,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:08:29,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:29,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:29,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:29,915 INFO L87 Difference]: Start difference. First operand 44513 states and 143418 transitions. Second operand 7 states. [2019-12-27 18:08:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:30,541 INFO L93 Difference]: Finished difference Result 55187 states and 176165 transitions. [2019-12-27 18:08:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:30,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 18:08:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:30,637 INFO L225 Difference]: With dead ends: 55187 [2019-12-27 18:08:30,637 INFO L226 Difference]: Without dead ends: 54793 [2019-12-27 18:08:30,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54793 states. [2019-12-27 18:08:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54793 to 43795. [2019-12-27 18:08:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43795 states. [2019-12-27 18:08:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43795 states to 43795 states and 140903 transitions. [2019-12-27 18:08:31,838 INFO L78 Accepts]: Start accepts. Automaton has 43795 states and 140903 transitions. Word has length 29 [2019-12-27 18:08:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:31,838 INFO L462 AbstractCegarLoop]: Abstraction has 43795 states and 140903 transitions. [2019-12-27 18:08:31,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 43795 states and 140903 transitions. [2019-12-27 18:08:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:08:31,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:31,857 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-27 18:08:31,857 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-27 18:08:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-27 18:08:31,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:31,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803336151] [2019-12-27 18:08:31,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:31,895 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-27 18:08:31,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803336151] [2019-12-27 18:08:31,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:31,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:31,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109694617] [2019-12-27 18:08:31,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:31,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:31,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 18:08:31,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:31,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:31,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:08:31,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:31,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:08:31,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:31,930 INFO L87 Difference]: Start difference. First operand 43795 states and 140903 transitions. Second operand 4 states. [2019-12-27 18:08:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:32,167 INFO L93 Difference]: Finished difference Result 67942 states and 220761 transitions. [2019-12-27 18:08:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:32,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 18:08:32,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:32,225 INFO L225 Difference]: With dead ends: 67942 [2019-12-27 18:08:32,225 INFO L226 Difference]: Without dead ends: 32397 [2019-12-27 18:08:32,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32397 states. [2019-12-27 18:08:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32397 to 31522. [2019-12-27 18:08:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31522 states. [2019-12-27 18:08:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31522 states to 31522 states and 100287 transitions. [2019-12-27 18:08:32,754 INFO L78 Accepts]: Start accepts. Automaton has 31522 states and 100287 transitions. Word has length 29 [2019-12-27 18:08:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:32,755 INFO L462 AbstractCegarLoop]: Abstraction has 31522 states and 100287 transitions. [2019-12-27 18:08:32,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:08:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 31522 states and 100287 transitions. [2019-12-27 18:08:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:08:32,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:32,768 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-27 18:08:32,768 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-27 18:08:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-27 18:08:32,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:32,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590971345] [2019-12-27 18:08:32,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:32,833 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-27 18:08:32,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590971345] [2019-12-27 18:08:32,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:32,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:32,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289755691] [2019-12-27 18:08:32,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:32,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:32,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 52 transitions. [2019-12-27 18:08:32,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:32,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:08:32,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:32,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:32,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:32,862 INFO L87 Difference]: Start difference. First operand 31522 states and 100287 transitions. Second operand 5 states. [2019-12-27 18:08:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:33,352 INFO L93 Difference]: Finished difference Result 70384 states and 230715 transitions. [2019-12-27 18:08:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:33,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 18:08:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:33,429 INFO L225 Difference]: With dead ends: 70384 [2019-12-27 18:08:33,430 INFO L226 Difference]: Without dead ends: 42005 [2019-12-27 18:08:33,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42005 states. [2019-12-27 18:08:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42005 to 24904. [2019-12-27 18:08:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24904 states. [2019-12-27 18:08:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24904 states to 24904 states and 81632 transitions. [2019-12-27 18:08:34,219 INFO L78 Accepts]: Start accepts. Automaton has 24904 states and 81632 transitions. Word has length 30 [2019-12-27 18:08:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:34,220 INFO L462 AbstractCegarLoop]: Abstraction has 24904 states and 81632 transitions. [2019-12-27 18:08:34,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24904 states and 81632 transitions. [2019-12-27 18:08:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:08:34,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:34,232 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-27 18:08:34,233 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-27 18:08:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-27 18:08:34,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:34,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746019772] [2019-12-27 18:08:34,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:34,311 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-27 18:08:34,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746019772] [2019-12-27 18:08:34,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:34,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:08:34,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123242648] [2019-12-27 18:08:34,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:34,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:34,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 18:08:34,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:34,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:08:34,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:08:34,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:08:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:08:34,423 INFO L87 Difference]: Start difference. First operand 24904 states and 81632 transitions. Second operand 8 states. [2019-12-27 18:08:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:35,174 INFO L93 Difference]: Finished difference Result 40035 states and 129044 transitions. [2019-12-27 18:08:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:35,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 18:08:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:35,241 INFO L225 Difference]: With dead ends: 40035 [2019-12-27 18:08:35,241 INFO L226 Difference]: Without dead ends: 40035 [2019-12-27 18:08:35,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40035 states. [2019-12-27 18:08:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40035 to 32700. [2019-12-27 18:08:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32700 states. [2019-12-27 18:08:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32700 states to 32700 states and 106238 transitions. [2019-12-27 18:08:35,836 INFO L78 Accepts]: Start accepts. Automaton has 32700 states and 106238 transitions. Word has length 30 [2019-12-27 18:08:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:35,837 INFO L462 AbstractCegarLoop]: Abstraction has 32700 states and 106238 transitions. [2019-12-27 18:08:35,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:08:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32700 states and 106238 transitions. [2019-12-27 18:08:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:08:35,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:35,860 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-27 18:08:35,860 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-27 18:08:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-27 18:08:35,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:35,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788260813] [2019-12-27 18:08:35,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:35,939 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-27 18:08:35,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788260813] [2019-12-27 18:08:35,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:35,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:35,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581059294] [2019-12-27 18:08:35,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:35,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:35,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 18:08:35,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:36,164 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 18:08:36,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:36,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:36,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:36,166 INFO L87 Difference]: Start difference. First operand 32700 states and 106238 transitions. Second operand 6 states. [2019-12-27 18:08:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:36,277 INFO L93 Difference]: Finished difference Result 15040 states and 45214 transitions. [2019-12-27 18:08:36,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:36,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:08:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:36,296 INFO L225 Difference]: With dead ends: 15040 [2019-12-27 18:08:36,296 INFO L226 Difference]: Without dead ends: 12648 [2019-12-27 18:08:36,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:08:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2019-12-27 18:08:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 12434. [2019-12-27 18:08:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12434 states. [2019-12-27 18:08:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12434 states to 12434 states and 37089 transitions. [2019-12-27 18:08:36,470 INFO L78 Accepts]: Start accepts. Automaton has 12434 states and 37089 transitions. Word has length 31 [2019-12-27 18:08:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:36,470 INFO L462 AbstractCegarLoop]: Abstraction has 12434 states and 37089 transitions. [2019-12-27 18:08:36,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12434 states and 37089 transitions. [2019-12-27 18:08:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:36,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:36,482 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-27 18:08:36,482 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-27 18:08:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-27 18:08:36,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:36,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607360924] [2019-12-27 18:08:36,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:36,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607360924] [2019-12-27 18:08:36,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:36,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:36,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361418564] [2019-12-27 18:08:36,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:36,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:36,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 18:08:36,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:36,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:36,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:36,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:36,656 INFO L87 Difference]: Start difference. First operand 12434 states and 37089 transitions. Second operand 6 states. [2019-12-27 18:08:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:36,913 INFO L93 Difference]: Finished difference Result 12560 states and 37323 transitions. [2019-12-27 18:08:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:36,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:08:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:36,930 INFO L225 Difference]: With dead ends: 12560 [2019-12-27 18:08:36,930 INFO L226 Difference]: Without dead ends: 12333 [2019-12-27 18:08:36,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12333 states. [2019-12-27 18:08:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12333 to 12333. [2019-12-27 18:08:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12333 states. [2019-12-27 18:08:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12333 states to 12333 states and 36878 transitions. [2019-12-27 18:08:37,102 INFO L78 Accepts]: Start accepts. Automaton has 12333 states and 36878 transitions. Word has length 40 [2019-12-27 18:08:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:37,102 INFO L462 AbstractCegarLoop]: Abstraction has 12333 states and 36878 transitions. [2019-12-27 18:08:37,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 12333 states and 36878 transitions. [2019-12-27 18:08:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:37,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:37,114 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-27 18:08:37,114 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-27 18:08:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-27 18:08:37,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:37,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821744977] [2019-12-27 18:08:37,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:37,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821744977] [2019-12-27 18:08:37,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:37,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:37,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007826018] [2019-12-27 18:08:37,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:37,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:37,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:08:37,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:37,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:08:37,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:08:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:08:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:37,329 INFO L87 Difference]: Start difference. First operand 12333 states and 36878 transitions. Second operand 9 states. [2019-12-27 18:08:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:39,000 INFO L93 Difference]: Finished difference Result 42008 states and 123572 transitions. [2019-12-27 18:08:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:08:39,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 18:08:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:39,063 INFO L225 Difference]: With dead ends: 42008 [2019-12-27 18:08:39,063 INFO L226 Difference]: Without dead ends: 42008 [2019-12-27 18:08:39,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:08:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42008 states. [2019-12-27 18:08:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42008 to 14381. [2019-12-27 18:08:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14381 states. [2019-12-27 18:08:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14381 states to 14381 states and 43273 transitions. [2019-12-27 18:08:39,443 INFO L78 Accepts]: Start accepts. Automaton has 14381 states and 43273 transitions. Word has length 40 [2019-12-27 18:08:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:39,443 INFO L462 AbstractCegarLoop]: Abstraction has 14381 states and 43273 transitions. [2019-12-27 18:08:39,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:08:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14381 states and 43273 transitions. [2019-12-27 18:08:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:39,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:39,462 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-27 18:08:39,462 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-27 18:08:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-27 18:08:39,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:39,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251967618] [2019-12-27 18:08:39,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:39,650 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-27 18:08:39,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251967618] [2019-12-27 18:08:39,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:39,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:39,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354755169] [2019-12-27 18:08:39,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:39,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:39,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 199 transitions. [2019-12-27 18:08:39,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:39,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:08:39,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:39,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:39,787 INFO L87 Difference]: Start difference. First operand 14381 states and 43273 transitions. Second operand 10 states. [2019-12-27 18:08:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:42,353 INFO L93 Difference]: Finished difference Result 42381 states and 124298 transitions. [2019-12-27 18:08:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 18:08:42,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 18:08:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:42,443 INFO L225 Difference]: With dead ends: 42381 [2019-12-27 18:08:42,443 INFO L226 Difference]: Without dead ends: 42381 [2019-12-27 18:08:42,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:08:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42381 states. [2019-12-27 18:08:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42381 to 15043. [2019-12-27 18:08:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15043 states. [2019-12-27 18:08:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 45227 transitions. [2019-12-27 18:08:42,879 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 45227 transitions. Word has length 40 [2019-12-27 18:08:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:42,879 INFO L462 AbstractCegarLoop]: Abstraction has 15043 states and 45227 transitions. [2019-12-27 18:08:42,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 45227 transitions. [2019-12-27 18:08:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:42,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:42,894 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-27 18:08:42,894 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-27 18:08:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:42,894 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 3 times [2019-12-27 18:08:42,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:42,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224323851] [2019-12-27 18:08:42,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:42,975 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-27 18:08:42,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224323851] [2019-12-27 18:08:42,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:42,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:42,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663701788] [2019-12-27 18:08:42,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:42,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:43,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 182 transitions. [2019-12-27 18:08:43,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:43,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:08:43,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:08:43,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:08:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:43,132 INFO L87 Difference]: Start difference. First operand 15043 states and 45227 transitions. Second operand 9 states. [2019-12-27 18:08:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:44,531 INFO L93 Difference]: Finished difference Result 22300 states and 65895 transitions. [2019-12-27 18:08:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:08:44,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 18:08:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:44,561 INFO L225 Difference]: With dead ends: 22300 [2019-12-27 18:08:44,561 INFO L226 Difference]: Without dead ends: 22300 [2019-12-27 18:08:44,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:08:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22300 states. [2019-12-27 18:08:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22300 to 15103. [2019-12-27 18:08:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15103 states. [2019-12-27 18:08:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15103 states to 15103 states and 45397 transitions. [2019-12-27 18:08:44,955 INFO L78 Accepts]: Start accepts. Automaton has 15103 states and 45397 transitions. Word has length 40 [2019-12-27 18:08:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:44,955 INFO L462 AbstractCegarLoop]: Abstraction has 15103 states and 45397 transitions. [2019-12-27 18:08:44,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:08:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15103 states and 45397 transitions. [2019-12-27 18:08:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:08:44,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:44,971 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] [2019-12-27 18:08:44,971 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-27 18:08:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-27 18:08:44,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:44,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139915447] [2019-12-27 18:08:44,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:45,061 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-27 18:08:45,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139915447] [2019-12-27 18:08:45,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:45,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:45,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440874979] [2019-12-27 18:08:45,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:45,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:45,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 161 transitions. [2019-12-27 18:08:45,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:45,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:08:45,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:45,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:45,205 INFO L87 Difference]: Start difference. First operand 15103 states and 45397 transitions. Second operand 7 states. [2019-12-27 18:08:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:46,007 INFO L93 Difference]: Finished difference Result 25246 states and 75283 transitions. [2019-12-27 18:08:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:08:46,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:08:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:46,042 INFO L225 Difference]: With dead ends: 25246 [2019-12-27 18:08:46,042 INFO L226 Difference]: Without dead ends: 24905 [2019-12-27 18:08:46,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:08:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24905 states. [2019-12-27 18:08:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24905 to 15558. [2019-12-27 18:08:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15558 states. [2019-12-27 18:08:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 46963 transitions. [2019-12-27 18:08:46,325 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 46963 transitions. Word has length 41 [2019-12-27 18:08:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:46,325 INFO L462 AbstractCegarLoop]: Abstraction has 15558 states and 46963 transitions. [2019-12-27 18:08:46,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 46963 transitions. [2019-12-27 18:08:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:08:46,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:46,341 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] [2019-12-27 18:08:46,342 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-27 18:08:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-27 18:08:46,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:46,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416089478] [2019-12-27 18:08:46,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:46,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416089478] [2019-12-27 18:08:46,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:46,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:08:46,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017797005] [2019-12-27 18:08:46,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:46,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:46,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 163 transitions. [2019-12-27 18:08:46,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:46,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:46,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:46,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:46,465 INFO L87 Difference]: Start difference. First operand 15558 states and 46963 transitions. Second operand 6 states. [2019-12-27 18:08:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:46,574 INFO L93 Difference]: Finished difference Result 14363 states and 43913 transitions. [2019-12-27 18:08:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:46,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 18:08:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:46,595 INFO L225 Difference]: With dead ends: 14363 [2019-12-27 18:08:46,596 INFO L226 Difference]: Without dead ends: 14163 [2019-12-27 18:08:46,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-27 18:08:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14163 states. [2019-12-27 18:08:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14163 to 12460. [2019-12-27 18:08:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-12-27 18:08:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 38613 transitions. [2019-12-27 18:08:46,788 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 38613 transitions. Word has length 41 [2019-12-27 18:08:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:46,788 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 38613 transitions. [2019-12-27 18:08:46,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 38613 transitions. [2019-12-27 18:08:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:46,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:46,802 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-27 18:08:46,802 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-27 18:08:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1638387748, now seen corresponding path program 1 times [2019-12-27 18:08:46,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:46,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882848863] [2019-12-27 18:08:46,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:46,885 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-27 18:08:46,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882848863] [2019-12-27 18:08:46,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:46,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:46,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869462518] [2019-12-27 18:08:46,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:46,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:47,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:08:47,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:47,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:47,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:47,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:47,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:47,099 INFO L87 Difference]: Start difference. First operand 12460 states and 38613 transitions. Second operand 10 states. [2019-12-27 18:08:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:49,834 INFO L93 Difference]: Finished difference Result 41398 states and 124792 transitions. [2019-12-27 18:08:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:08:49,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:49,882 INFO L225 Difference]: With dead ends: 41398 [2019-12-27 18:08:49,882 INFO L226 Difference]: Without dead ends: 31510 [2019-12-27 18:08:49,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 18:08:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31510 states. [2019-12-27 18:08:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31510 to 14476. [2019-12-27 18:08:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14476 states. [2019-12-27 18:08:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14476 states to 14476 states and 44317 transitions. [2019-12-27 18:08:50,215 INFO L78 Accepts]: Start accepts. Automaton has 14476 states and 44317 transitions. Word has length 54 [2019-12-27 18:08:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:50,215 INFO L462 AbstractCegarLoop]: Abstraction has 14476 states and 44317 transitions. [2019-12-27 18:08:50,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14476 states and 44317 transitions. [2019-12-27 18:08:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:50,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:50,231 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-27 18:08:50,231 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-27 18:08:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 341327716, now seen corresponding path program 2 times [2019-12-27 18:08:50,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:50,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285426328] [2019-12-27 18:08:50,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:50,306 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-27 18:08:50,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285426328] [2019-12-27 18:08:50,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:50,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:50,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474548664] [2019-12-27 18:08:50,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:50,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:50,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:08:50,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:50,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:50,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:50,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:50,551 INFO L87 Difference]: Start difference. First operand 14476 states and 44317 transitions. Second operand 10 states. [2019-12-27 18:08:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:51,800 INFO L93 Difference]: Finished difference Result 28816 states and 87103 transitions. [2019-12-27 18:08:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:08:51,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:51,835 INFO L225 Difference]: With dead ends: 28816 [2019-12-27 18:08:51,835 INFO L226 Difference]: Without dead ends: 21612 [2019-12-27 18:08:51,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:08:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21612 states. [2019-12-27 18:08:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21612 to 16545. [2019-12-27 18:08:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16545 states. [2019-12-27 18:08:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 49992 transitions. [2019-12-27 18:08:52,232 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 49992 transitions. Word has length 54 [2019-12-27 18:08:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:52,233 INFO L462 AbstractCegarLoop]: Abstraction has 16545 states and 49992 transitions. [2019-12-27 18:08:52,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 49992 transitions. [2019-12-27 18:08:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:52,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:52,249 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-27 18:08:52,249 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-27 18:08:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1312613832, now seen corresponding path program 3 times [2019-12-27 18:08:52,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:52,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519350208] [2019-12-27 18:08:52,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:52,328 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-27 18:08:52,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519350208] [2019-12-27 18:08:52,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:52,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:52,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557739620] [2019-12-27 18:08:52,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:52,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:52,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 307 transitions. [2019-12-27 18:08:52,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:52,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:52,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:52,492 INFO L87 Difference]: Start difference. First operand 16545 states and 49992 transitions. Second operand 10 states. [2019-12-27 18:08:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:53,819 INFO L93 Difference]: Finished difference Result 40567 states and 120908 transitions. [2019-12-27 18:08:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:08:53,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:08:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:53,871 INFO L225 Difference]: With dead ends: 40567 [2019-12-27 18:08:53,871 INFO L226 Difference]: Without dead ends: 38155 [2019-12-27 18:08:53,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=1213, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:08:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38155 states. [2019-12-27 18:08:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38155 to 16360. [2019-12-27 18:08:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16360 states. [2019-12-27 18:08:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16360 states to 16360 states and 49426 transitions. [2019-12-27 18:08:54,251 INFO L78 Accepts]: Start accepts. Automaton has 16360 states and 49426 transitions. Word has length 54 [2019-12-27 18:08:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:54,251 INFO L462 AbstractCegarLoop]: Abstraction has 16360 states and 49426 transitions. [2019-12-27 18:08:54,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 16360 states and 49426 transitions. [2019-12-27 18:08:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:54,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:54,268 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-27 18:08:54,268 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-27 18:08:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1898016224, now seen corresponding path program 4 times [2019-12-27 18:08:54,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:54,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513875081] [2019-12-27 18:08:54,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:54,362 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-27 18:08:54,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513875081] [2019-12-27 18:08:54,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:54,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:54,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397355812] [2019-12-27 18:08:54,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:54,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:54,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 437 transitions. [2019-12-27 18:08:54,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:54,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:08:54,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:08:54,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:08:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:08:54,783 INFO L87 Difference]: Start difference. First operand 16360 states and 49426 transitions. Second operand 11 states. [2019-12-27 18:08:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:58,030 INFO L93 Difference]: Finished difference Result 46697 states and 138525 transitions. [2019-12-27 18:08:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:08:58,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 18:08:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:58,100 INFO L225 Difference]: With dead ends: 46697 [2019-12-27 18:08:58,100 INFO L226 Difference]: Without dead ends: 46697 [2019-12-27 18:08:58,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:08:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46697 states. [2019-12-27 18:08:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46697 to 17009. [2019-12-27 18:08:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17009 states. [2019-12-27 18:08:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17009 states to 17009 states and 51257 transitions. [2019-12-27 18:08:58,557 INFO L78 Accepts]: Start accepts. Automaton has 17009 states and 51257 transitions. Word has length 54 [2019-12-27 18:08:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 17009 states and 51257 transitions. [2019-12-27 18:08:58,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:08:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17009 states and 51257 transitions. [2019-12-27 18:08:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:08:58,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:58,576 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-27 18:08:58,576 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-27 18:08:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1164320748, now seen corresponding path program 5 times [2019-12-27 18:08:58,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:58,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770354669] [2019-12-27 18:08:58,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:58,660 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-27 18:08:58,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770354669] [2019-12-27 18:08:58,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:58,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:58,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244903419] [2019-12-27 18:08:58,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:58,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:58,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 424 transitions. [2019-12-27 18:08:58,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:58,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:08:58,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:58,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:58,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:58,966 INFO L87 Difference]: Start difference. First operand 17009 states and 51257 transitions. Second operand 10 states. Received shutdown request... [2019-12-27 18:09:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:09:00,314 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:09:00,319 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:09:00,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:09:00 BasicIcfg [2019-12-27 18:09:00,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:09:00,321 INFO L168 Benchmark]: Toolchain (without parser) took 194923.84 ms. Allocated memory was 137.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,322 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.67 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.05 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,324 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,324 INFO L168 Benchmark]: RCFGBuilder took 883.02 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,325 INFO L168 Benchmark]: TraceAbstraction took 193123.54 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 103.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 18:09:00,327 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.67 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.05 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.02 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193123.54 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 103.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 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.1s, 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 (17009states) and FLOYD_HOARE automaton (currently 17 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (5061 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 (17009states) and FLOYD_HOARE automaton (currently 17 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (5061 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 71.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5652 SDtfs, 10211 SDslu, 14740 SDs, 0 SdLazy, 13238 SolverSat, 687 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 180 SyntacticMatches, 39 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171713occurred 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: 96.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 459338 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 885 ConstructedInterpolants, 0 QuantifiedInterpolants, 108267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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