/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:34:13,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:34:13,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:34:13,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:34:13,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:34:13,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:34:13,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:34:13,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:34:13,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:34:13,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:34:13,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:34:13,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:34:13,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:34:13,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:34:13,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:34:13,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:34:13,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:34:13,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:34:13,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:34:13,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:34:13,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:34:13,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:34:13,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:34:13,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:34:13,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:34:13,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:34:13,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:34:13,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:34:13,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:34:13,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:34:13,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:34:13,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:34:13,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:34:13,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:34:13,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:34:13,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:34:13,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:34:13,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:34:13,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:34:13,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:34:13,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:34:13,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:34:13,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:34:13,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:34:13,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:34:13,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:34:13,318 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:34:13,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:34:13,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:34:13,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:34:13,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:34:13,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:34:13,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:34:13,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:34:13,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:34:13,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:34:13,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:34:13,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:34:13,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:34:13,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:34:13,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:34:13,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:34:13,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:34:13,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:34:13,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:34:13,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:34:13,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:34:13,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:34:13,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:34:13,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:34:13,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:34:13,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:34:13,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:34:13,634 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:34:13,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-27 20:34:13,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d9e18a/050218b56ffb466892601c897c657ccd/FLAG17c4ed8a1 [2019-12-27 20:34:14,317 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:34:14,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-27 20:34:14,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d9e18a/050218b56ffb466892601c897c657ccd/FLAG17c4ed8a1 [2019-12-27 20:34:14,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d9e18a/050218b56ffb466892601c897c657ccd [2019-12-27 20:34:14,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:34:14,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:34:14,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:34:14,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:34:14,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:34:14,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:34:14" (1/1) ... [2019-12-27 20:34:14,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba015a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:14, skipping insertion in model container [2019-12-27 20:34:14,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:34:14" (1/1) ... [2019-12-27 20:34:14,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:34:14,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:34:15,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:34:15,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:34:15,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:34:15,334 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:34:15,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15 WrapperNode [2019-12-27 20:34:15,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:34:15,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:34:15,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:34:15,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:34:15,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:34:15,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:34:15,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:34:15,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:34:15,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (1/1) ... [2019-12-27 20:34:15,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:34:15,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:34:15,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:34:15,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:34:15,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (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 20:34:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:34:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:34:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:34:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:34:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:34:15,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:34:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:34:15,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:34:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:34:15,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:34:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:34:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:34:15,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:34:15,508 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 20:34:16,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:34:16,234 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:34:16,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:34:16 BoogieIcfgContainer [2019-12-27 20:34:16,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:34:16,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:34:16,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:34:16,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:34:16,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:34:14" (1/3) ... [2019-12-27 20:34:16,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cfe20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:34:16, skipping insertion in model container [2019-12-27 20:34:16,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:15" (2/3) ... [2019-12-27 20:34:16,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cfe20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:34:16, skipping insertion in model container [2019-12-27 20:34:16,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:34:16" (3/3) ... [2019-12-27 20:34:16,244 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt.i [2019-12-27 20:34:16,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:34:16,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:34:16,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:34:16,264 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:34:16,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,353 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,353 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,368 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,368 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:16,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:34:16,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:34:16,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:34:16,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:34:16,413 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:34:16,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:34:16,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:34:16,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:34:16,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:34:16,430 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 20:34:16,432 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 20:34:16,531 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 20:34:16,532 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:34:16,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:34:16,570 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 20:34:16,622 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 20:34:16,622 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:34:16,630 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:34:16,650 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:34:16,652 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:34:20,426 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:34:20,578 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:34:20,605 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68107 [2019-12-27 20:34:20,606 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 20:34:20,610 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-27 20:34:32,679 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 20:34:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 20:34:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:34:32,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:32,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:34:32,688 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 20:34:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 799324594, now seen corresponding path program 1 times [2019-12-27 20:34:32,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:32,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230564185] [2019-12-27 20:34:32,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:32,979 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 20:34:32,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230564185] [2019-12-27 20:34:32,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:32,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:34:32,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112754079] [2019-12-27 20:34:32,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:32,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:32,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:34:32,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:32,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:34:33,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:34:33,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:34:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:34:33,017 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 20:34:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:35,976 INFO L93 Difference]: Finished difference Result 87213 states and 375136 transitions. [2019-12-27 20:34:35,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:34:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:34:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:36,537 INFO L225 Difference]: With dead ends: 87213 [2019-12-27 20:34:36,537 INFO L226 Difference]: Without dead ends: 82117 [2019-12-27 20:34:36,538 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 20:34:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82117 states. [2019-12-27 20:34:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82117 to 82117. [2019-12-27 20:34:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82117 states. [2019-12-27 20:34:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82117 states to 82117 states and 352722 transitions. [2019-12-27 20:34:44,052 INFO L78 Accepts]: Start accepts. Automaton has 82117 states and 352722 transitions. Word has length 5 [2019-12-27 20:34:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:44,052 INFO L462 AbstractCegarLoop]: Abstraction has 82117 states and 352722 transitions. [2019-12-27 20:34:44,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:34:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 82117 states and 352722 transitions. [2019-12-27 20:34:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:34:46,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:46,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:46,679 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 20:34:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1561636486, now seen corresponding path program 1 times [2019-12-27 20:34:46,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:46,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152975075] [2019-12-27 20:34:46,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:46,821 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 20:34:46,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152975075] [2019-12-27 20:34:46,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:46,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:34:46,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600542712] [2019-12-27 20:34:46,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:46,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:46,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:34:46,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:46,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:34:46,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:34:46,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:34:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:34:46,831 INFO L87 Difference]: Start difference. First operand 82117 states and 352722 transitions. Second operand 4 states. [2019-12-27 20:34:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:47,792 INFO L93 Difference]: Finished difference Result 125342 states and 514910 transitions. [2019-12-27 20:34:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:34:47,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:34:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:48,851 INFO L225 Difference]: With dead ends: 125342 [2019-12-27 20:34:48,852 INFO L226 Difference]: Without dead ends: 125251 [2019-12-27 20:34:48,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:34:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125251 states. [2019-12-27 20:34:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125251 to 113136. [2019-12-27 20:34:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113136 states. [2019-12-27 20:34:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113136 states to 113136 states and 471690 transitions. [2019-12-27 20:34:59,424 INFO L78 Accepts]: Start accepts. Automaton has 113136 states and 471690 transitions. Word has length 13 [2019-12-27 20:34:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:59,425 INFO L462 AbstractCegarLoop]: Abstraction has 113136 states and 471690 transitions. [2019-12-27 20:34:59,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:34:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 113136 states and 471690 transitions. [2019-12-27 20:34:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:34:59,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:59,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:59,430 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 20:34:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash 994155576, now seen corresponding path program 1 times [2019-12-27 20:34:59,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:59,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863670779] [2019-12-27 20:34:59,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:59,543 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 20:34:59,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863670779] [2019-12-27 20:34:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:59,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:34:59,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473201023] [2019-12-27 20:34:59,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:59,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:59,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:34:59,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:59,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:34:59,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:34:59,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:34:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:34:59,549 INFO L87 Difference]: Start difference. First operand 113136 states and 471690 transitions. Second operand 4 states. [2019-12-27 20:34:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:59,726 INFO L93 Difference]: Finished difference Result 36342 states and 127270 transitions. [2019-12-27 20:34:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:34:59,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:34:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:59,814 INFO L225 Difference]: With dead ends: 36342 [2019-12-27 20:34:59,815 INFO L226 Difference]: Without dead ends: 28573 [2019-12-27 20:34:59,815 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 20:35:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28573 states. [2019-12-27 20:35:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28573 to 28509. [2019-12-27 20:35:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28509 states. [2019-12-27 20:35:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28509 states to 28509 states and 96204 transitions. [2019-12-27 20:35:01,447 INFO L78 Accepts]: Start accepts. Automaton has 28509 states and 96204 transitions. Word has length 13 [2019-12-27 20:35:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:01,447 INFO L462 AbstractCegarLoop]: Abstraction has 28509 states and 96204 transitions. [2019-12-27 20:35:01,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28509 states and 96204 transitions. [2019-12-27 20:35:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:35:01,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:01,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:01,450 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 20:35:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:01,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1804075732, now seen corresponding path program 1 times [2019-12-27 20:35:01,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:01,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919580031] [2019-12-27 20:35:01,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:01,578 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 20:35:01,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919580031] [2019-12-27 20:35:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:01,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000119308] [2019-12-27 20:35:01,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:01,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:01,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:35:01,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:01,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:35:01,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:01,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:01,654 INFO L87 Difference]: Start difference. First operand 28509 states and 96204 transitions. Second operand 5 states. [2019-12-27 20:35:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:02,063 INFO L93 Difference]: Finished difference Result 36737 states and 121975 transitions. [2019-12-27 20:35:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:02,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:35:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:02,160 INFO L225 Difference]: With dead ends: 36737 [2019-12-27 20:35:02,160 INFO L226 Difference]: Without dead ends: 36639 [2019-12-27 20:35:02,161 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 20:35:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36639 states. [2019-12-27 20:35:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36639 to 32064. [2019-12-27 20:35:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32064 states. [2019-12-27 20:35:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32064 states to 32064 states and 107530 transitions. [2019-12-27 20:35:04,809 INFO L78 Accepts]: Start accepts. Automaton has 32064 states and 107530 transitions. Word has length 14 [2019-12-27 20:35:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:04,810 INFO L462 AbstractCegarLoop]: Abstraction has 32064 states and 107530 transitions. [2019-12-27 20:35:04,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 32064 states and 107530 transitions. [2019-12-27 20:35:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:35:04,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:04,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:04,812 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 20:35:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1804212504, now seen corresponding path program 1 times [2019-12-27 20:35:04,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:04,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619321767] [2019-12-27 20:35:04,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:04,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619321767] [2019-12-27 20:35:04,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:04,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:04,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689405264] [2019-12-27 20:35:04,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:04,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:04,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:35:04,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:04,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:35:04,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:04,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:04,891 INFO L87 Difference]: Start difference. First operand 32064 states and 107530 transitions. Second operand 5 states. [2019-12-27 20:35:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:05,178 INFO L93 Difference]: Finished difference Result 47423 states and 159916 transitions. [2019-12-27 20:35:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:35:05,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:35:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:05,260 INFO L225 Difference]: With dead ends: 47423 [2019-12-27 20:35:05,260 INFO L226 Difference]: Without dead ends: 47423 [2019-12-27 20:35:05,261 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 20:35:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47423 states. [2019-12-27 20:35:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47423 to 37143. [2019-12-27 20:35:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-12-27 20:35:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 124911 transitions. [2019-12-27 20:35:05,952 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 124911 transitions. Word has length 14 [2019-12-27 20:35:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:05,953 INFO L462 AbstractCegarLoop]: Abstraction has 37143 states and 124911 transitions. [2019-12-27 20:35:05,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 124911 transitions. [2019-12-27 20:35:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:35:05,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:05,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:05,955 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 20:35:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1968777988, now seen corresponding path program 1 times [2019-12-27 20:35:05,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:05,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890078958] [2019-12-27 20:35:05,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:06,037 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 20:35:06,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890078958] [2019-12-27 20:35:06,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:06,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:06,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235434953] [2019-12-27 20:35:06,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:06,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:06,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:35:06,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:06,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:35:06,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:06,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:06,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:06,069 INFO L87 Difference]: Start difference. First operand 37143 states and 124911 transitions. Second operand 5 states. [2019-12-27 20:35:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:06,444 INFO L93 Difference]: Finished difference Result 44051 states and 146328 transitions. [2019-12-27 20:35:06,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:06,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:35:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:06,867 INFO L225 Difference]: With dead ends: 44051 [2019-12-27 20:35:06,867 INFO L226 Difference]: Without dead ends: 43953 [2019-12-27 20:35:06,868 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 20:35:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43953 states. [2019-12-27 20:35:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43953 to 37562. [2019-12-27 20:35:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37562 states. [2019-12-27 20:35:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37562 states to 37562 states and 126032 transitions. [2019-12-27 20:35:07,520 INFO L78 Accepts]: Start accepts. Automaton has 37562 states and 126032 transitions. Word has length 14 [2019-12-27 20:35:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:07,521 INFO L462 AbstractCegarLoop]: Abstraction has 37562 states and 126032 transitions. [2019-12-27 20:35:07,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37562 states and 126032 transitions. [2019-12-27 20:35:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:35:07,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:07,534 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 20:35:07,535 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 20:35:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 464033414, now seen corresponding path program 1 times [2019-12-27 20:35:07,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:07,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014677102] [2019-12-27 20:35:07,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:07,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014677102] [2019-12-27 20:35:07,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:07,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:07,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105295118] [2019-12-27 20:35:07,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:07,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:07,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 20:35:07,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:07,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:35:07,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:07,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:07,735 INFO L87 Difference]: Start difference. First operand 37562 states and 126032 transitions. Second operand 7 states. [2019-12-27 20:35:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:08,566 INFO L93 Difference]: Finished difference Result 50496 states and 166168 transitions. [2019-12-27 20:35:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:35:08,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:35:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:08,661 INFO L225 Difference]: With dead ends: 50496 [2019-12-27 20:35:08,661 INFO L226 Difference]: Without dead ends: 50306 [2019-12-27 20:35:08,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:35:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50306 states. [2019-12-27 20:35:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50306 to 38560. [2019-12-27 20:35:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-27 20:35:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 129178 transitions. [2019-12-27 20:35:09,808 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 129178 transitions. Word has length 22 [2019-12-27 20:35:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:09,809 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 129178 transitions. [2019-12-27 20:35:09,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 129178 transitions. [2019-12-27 20:35:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:35:09,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:09,819 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 20:35:09,820 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 20:35:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1825144588, now seen corresponding path program 1 times [2019-12-27 20:35:09,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:09,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27780157] [2019-12-27 20:35:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:09,894 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 20:35:09,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27780157] [2019-12-27 20:35:09,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:09,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:09,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1651689894] [2019-12-27 20:35:09,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:09,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:09,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 20:35:09,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:09,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:09,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:09,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:09,913 INFO L87 Difference]: Start difference. First operand 38560 states and 129178 transitions. Second operand 5 states. [2019-12-27 20:35:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:10,557 INFO L93 Difference]: Finished difference Result 51048 states and 167840 transitions. [2019-12-27 20:35:10,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:35:10,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:35:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:10,657 INFO L225 Difference]: With dead ends: 51048 [2019-12-27 20:35:10,657 INFO L226 Difference]: Without dead ends: 50780 [2019-12-27 20:35:10,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50780 states. [2019-12-27 20:35:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50780 to 36339. [2019-12-27 20:35:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36339 states. [2019-12-27 20:35:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36339 states to 36339 states and 121828 transitions. [2019-12-27 20:35:11,885 INFO L78 Accepts]: Start accepts. Automaton has 36339 states and 121828 transitions. Word has length 22 [2019-12-27 20:35:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:11,885 INFO L462 AbstractCegarLoop]: Abstraction has 36339 states and 121828 transitions. [2019-12-27 20:35:11,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36339 states and 121828 transitions. [2019-12-27 20:35:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:35:11,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:11,897 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 20:35:11,897 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 20:35:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2069776038, now seen corresponding path program 1 times [2019-12-27 20:35:11,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:11,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44187386] [2019-12-27 20:35:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:12,114 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 20:35:12,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44187386] [2019-12-27 20:35:12,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:12,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:12,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49064395] [2019-12-27 20:35:12,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:12,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:12,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:35:12,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:12,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:12,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:12,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:12,126 INFO L87 Difference]: Start difference. First operand 36339 states and 121828 transitions. Second operand 7 states. [2019-12-27 20:35:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:12,763 INFO L93 Difference]: Finished difference Result 48916 states and 160536 transitions. [2019-12-27 20:35:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:35:12,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 20:35:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:12,854 INFO L225 Difference]: With dead ends: 48916 [2019-12-27 20:35:12,854 INFO L226 Difference]: Without dead ends: 48889 [2019-12-27 20:35:12,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2019-12-27 20:35:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 41136. [2019-12-27 20:35:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41136 states. [2019-12-27 20:35:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41136 states to 41136 states and 136683 transitions. [2019-12-27 20:35:13,668 INFO L78 Accepts]: Start accepts. Automaton has 41136 states and 136683 transitions. Word has length 25 [2019-12-27 20:35:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:13,668 INFO L462 AbstractCegarLoop]: Abstraction has 41136 states and 136683 transitions. [2019-12-27 20:35:13,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 41136 states and 136683 transitions. [2019-12-27 20:35:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:35:13,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:13,687 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 20:35:13,688 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 20:35:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1235001231, now seen corresponding path program 1 times [2019-12-27 20:35:13,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:13,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193968501] [2019-12-27 20:35:13,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:13,787 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 20:35:13,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193968501] [2019-12-27 20:35:13,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:13,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:35:13,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803378200] [2019-12-27 20:35:13,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:13,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:13,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 20:35:13,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:13,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:35:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:13,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:13,860 INFO L87 Difference]: Start difference. First operand 41136 states and 136683 transitions. Second operand 7 states. [2019-12-27 20:35:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:13,984 INFO L93 Difference]: Finished difference Result 17698 states and 55060 transitions. [2019-12-27 20:35:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:13,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 20:35:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:14,007 INFO L225 Difference]: With dead ends: 17698 [2019-12-27 20:35:14,007 INFO L226 Difference]: Without dead ends: 15112 [2019-12-27 20:35:14,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2019-12-27 20:35:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 14720. [2019-12-27 20:35:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14720 states. [2019-12-27 20:35:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14720 states to 14720 states and 45519 transitions. [2019-12-27 20:35:14,467 INFO L78 Accepts]: Start accepts. Automaton has 14720 states and 45519 transitions. Word has length 28 [2019-12-27 20:35:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:14,468 INFO L462 AbstractCegarLoop]: Abstraction has 14720 states and 45519 transitions. [2019-12-27 20:35:14,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14720 states and 45519 transitions. [2019-12-27 20:35:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:35:14,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:14,487 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] [2019-12-27 20:35:14,488 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 20:35:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1619802347, now seen corresponding path program 1 times [2019-12-27 20:35:14,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:14,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788772435] [2019-12-27 20:35:14,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:14,604 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 20:35:14,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788772435] [2019-12-27 20:35:14,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:14,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:14,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [968399810] [2019-12-27 20:35:14,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:14,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:14,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 146 transitions. [2019-12-27 20:35:14,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:14,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:35:14,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:35:14,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:35:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:35:14,737 INFO L87 Difference]: Start difference. First operand 14720 states and 45519 transitions. Second operand 8 states. [2019-12-27 20:35:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:15,708 INFO L93 Difference]: Finished difference Result 21622 states and 66199 transitions. [2019-12-27 20:35:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:35:15,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 20:35:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:15,739 INFO L225 Difference]: With dead ends: 21622 [2019-12-27 20:35:15,739 INFO L226 Difference]: Without dead ends: 21622 [2019-12-27 20:35:15,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 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 20:35:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21622 states. [2019-12-27 20:35:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21622 to 19702. [2019-12-27 20:35:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19702 states. [2019-12-27 20:35:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19702 states to 19702 states and 60795 transitions. [2019-12-27 20:35:16,039 INFO L78 Accepts]: Start accepts. Automaton has 19702 states and 60795 transitions. Word has length 39 [2019-12-27 20:35:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 19702 states and 60795 transitions. [2019-12-27 20:35:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:35:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 19702 states and 60795 transitions. [2019-12-27 20:35:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:35:16,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:16,067 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] [2019-12-27 20:35:16,067 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 20:35:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1504147243, now seen corresponding path program 2 times [2019-12-27 20:35:16,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:16,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950610918] [2019-12-27 20:35:16,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:16,157 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 20:35:16,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950610918] [2019-12-27 20:35:16,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:16,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:16,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973689135] [2019-12-27 20:35:16,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:16,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:16,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 116 transitions. [2019-12-27 20:35:16,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:16,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:35:16,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:35:16,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:16,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:35:16,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:16,208 INFO L87 Difference]: Start difference. First operand 19702 states and 60795 transitions. Second operand 4 states. [2019-12-27 20:35:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:16,486 INFO L93 Difference]: Finished difference Result 24948 states and 75356 transitions. [2019-12-27 20:35:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:16,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 20:35:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:16,520 INFO L225 Difference]: With dead ends: 24948 [2019-12-27 20:35:16,520 INFO L226 Difference]: Without dead ends: 24948 [2019-12-27 20:35:16,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24948 states. [2019-12-27 20:35:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24948 to 18641. [2019-12-27 20:35:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18641 states. [2019-12-27 20:35:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18641 states to 18641 states and 56901 transitions. [2019-12-27 20:35:16,819 INFO L78 Accepts]: Start accepts. Automaton has 18641 states and 56901 transitions. Word has length 39 [2019-12-27 20:35:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:16,820 INFO L462 AbstractCegarLoop]: Abstraction has 18641 states and 56901 transitions. [2019-12-27 20:35:16,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18641 states and 56901 transitions. [2019-12-27 20:35:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:16,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:16,840 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 20:35:16,841 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 20:35:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -942169455, now seen corresponding path program 1 times [2019-12-27 20:35:16,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:16,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143050192] [2019-12-27 20:35:16,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143050192] [2019-12-27 20:35:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:16,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928215539] [2019-12-27 20:35:16,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:16,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:16,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 171 transitions. [2019-12-27 20:35:16,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:17,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:35:17,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:35:17,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:35:17,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:35:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:35:17,179 INFO L87 Difference]: Start difference. First operand 18641 states and 56901 transitions. Second operand 8 states. [2019-12-27 20:35:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:17,828 INFO L93 Difference]: Finished difference Result 21596 states and 65074 transitions. [2019-12-27 20:35:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:35:17,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:35:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:17,860 INFO L225 Difference]: With dead ends: 21596 [2019-12-27 20:35:17,860 INFO L226 Difference]: Without dead ends: 21594 [2019-12-27 20:35:17,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:35:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21594 states. [2019-12-27 20:35:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21594 to 18864. [2019-12-27 20:35:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18864 states. [2019-12-27 20:35:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18864 states to 18864 states and 57518 transitions. [2019-12-27 20:35:18,253 INFO L78 Accepts]: Start accepts. Automaton has 18864 states and 57518 transitions. Word has length 40 [2019-12-27 20:35:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:18,254 INFO L462 AbstractCegarLoop]: Abstraction has 18864 states and 57518 transitions. [2019-12-27 20:35:18,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:35:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18864 states and 57518 transitions. [2019-12-27 20:35:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:18,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:18,274 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 20:35:18,274 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 20:35:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1669894095, now seen corresponding path program 2 times [2019-12-27 20:35:18,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:18,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821638019] [2019-12-27 20:35:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:18,379 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 20:35:18,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821638019] [2019-12-27 20:35:18,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:18,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:35:18,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609276135] [2019-12-27 20:35:18,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:18,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:18,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 144 transitions. [2019-12-27 20:35:18,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:18,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:35:18,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:35:18,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:35:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:35:18,476 INFO L87 Difference]: Start difference. First operand 18864 states and 57518 transitions. Second operand 6 states. [2019-12-27 20:35:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:19,189 INFO L93 Difference]: Finished difference Result 22429 states and 67296 transitions. [2019-12-27 20:35:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:35:19,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:35:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:19,223 INFO L225 Difference]: With dead ends: 22429 [2019-12-27 20:35:19,223 INFO L226 Difference]: Without dead ends: 22427 [2019-12-27 20:35:19,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:35:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22427 states. [2019-12-27 20:35:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22427 to 18652. [2019-12-27 20:35:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18652 states. [2019-12-27 20:35:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18652 states to 18652 states and 56852 transitions. [2019-12-27 20:35:19,518 INFO L78 Accepts]: Start accepts. Automaton has 18652 states and 56852 transitions. Word has length 40 [2019-12-27 20:35:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:19,518 INFO L462 AbstractCegarLoop]: Abstraction has 18652 states and 56852 transitions. [2019-12-27 20:35:19,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:35:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 18652 states and 56852 transitions. [2019-12-27 20:35:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:19,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:19,544 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 20:35:19,545 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 20:35:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1515515867, now seen corresponding path program 1 times [2019-12-27 20:35:19,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:19,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118947584] [2019-12-27 20:35:19,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:19,639 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 20:35:19,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118947584] [2019-12-27 20:35:19,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:19,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:19,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902037471] [2019-12-27 20:35:19,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:19,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:19,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 145 transitions. [2019-12-27 20:35:19,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:19,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:35:19,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:35:19,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:35:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:19,779 INFO L87 Difference]: Start difference. First operand 18652 states and 56852 transitions. Second operand 9 states. [2019-12-27 20:35:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:21,126 INFO L93 Difference]: Finished difference Result 24871 states and 74529 transitions. [2019-12-27 20:35:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:35:21,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 20:35:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:21,163 INFO L225 Difference]: With dead ends: 24871 [2019-12-27 20:35:21,163 INFO L226 Difference]: Without dead ends: 24871 [2019-12-27 20:35:21,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:35:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24871 states. [2019-12-27 20:35:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24871 to 19295. [2019-12-27 20:35:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19295 states. [2019-12-27 20:35:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19295 states to 19295 states and 58829 transitions. [2019-12-27 20:35:21,483 INFO L78 Accepts]: Start accepts. Automaton has 19295 states and 58829 transitions. Word has length 40 [2019-12-27 20:35:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:21,483 INFO L462 AbstractCegarLoop]: Abstraction has 19295 states and 58829 transitions. [2019-12-27 20:35:21,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:35:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19295 states and 58829 transitions. [2019-12-27 20:35:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:21,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:21,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:21,513 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 20:35:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -654521051, now seen corresponding path program 2 times [2019-12-27 20:35:21,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:21,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561559504] [2019-12-27 20:35:21,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:21,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561559504] [2019-12-27 20:35:21,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:21,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:21,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940213020] [2019-12-27 20:35:21,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:21,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:21,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 95 transitions. [2019-12-27 20:35:21,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:21,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:21,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:35:21,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:35:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:21,602 INFO L87 Difference]: Start difference. First operand 19295 states and 58829 transitions. Second operand 3 states. [2019-12-27 20:35:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:21,795 INFO L93 Difference]: Finished difference Result 19207 states and 58524 transitions. [2019-12-27 20:35:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:35:21,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 20:35:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:21,836 INFO L225 Difference]: With dead ends: 19207 [2019-12-27 20:35:21,836 INFO L226 Difference]: Without dead ends: 19207 [2019-12-27 20:35:21,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2019-12-27 20:35:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 16806. [2019-12-27 20:35:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2019-12-27 20:35:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 51634 transitions. [2019-12-27 20:35:22,260 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 51634 transitions. Word has length 40 [2019-12-27 20:35:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:22,261 INFO L462 AbstractCegarLoop]: Abstraction has 16806 states and 51634 transitions. [2019-12-27 20:35:22,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:35:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 51634 transitions. [2019-12-27 20:35:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:35:22,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:22,288 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 20:35:22,288 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 20:35:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash -835331995, now seen corresponding path program 1 times [2019-12-27 20:35:22,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:22,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072341939] [2019-12-27 20:35:22,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:22,389 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 20:35:22,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072341939] [2019-12-27 20:35:22,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:22,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:35:22,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [723935966] [2019-12-27 20:35:22,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:22,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:22,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 235 transitions. [2019-12-27 20:35:22,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:22,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:35:22,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:35:22,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:35:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:35:22,654 INFO L87 Difference]: Start difference. First operand 16806 states and 51634 transitions. Second operand 10 states. [2019-12-27 20:35:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:25,049 INFO L93 Difference]: Finished difference Result 38451 states and 114211 transitions. [2019-12-27 20:35:25,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:35:25,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-12-27 20:35:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:25,147 INFO L225 Difference]: With dead ends: 38451 [2019-12-27 20:35:25,147 INFO L226 Difference]: Without dead ends: 38447 [2019-12-27 20:35:25,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:35:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38447 states. [2019-12-27 20:35:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38447 to 16784. [2019-12-27 20:35:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16784 states. [2019-12-27 20:35:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16784 states to 16784 states and 51708 transitions. [2019-12-27 20:35:25,957 INFO L78 Accepts]: Start accepts. Automaton has 16784 states and 51708 transitions. Word has length 41 [2019-12-27 20:35:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:25,958 INFO L462 AbstractCegarLoop]: Abstraction has 16784 states and 51708 transitions. [2019-12-27 20:35:25,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:35:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16784 states and 51708 transitions. [2019-12-27 20:35:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:35:25,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:25,991 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 20:35:25,991 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 20:35:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1731134395, now seen corresponding path program 1 times [2019-12-27 20:35:25,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:25,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395381853] [2019-12-27 20:35:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:26,117 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 20:35:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395381853] [2019-12-27 20:35:26,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:26,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:26,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16117365] [2019-12-27 20:35:26,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:26,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:26,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 146 transitions. [2019-12-27 20:35:26,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:26,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:26,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:26,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:26,182 INFO L87 Difference]: Start difference. First operand 16784 states and 51708 transitions. Second operand 7 states. [2019-12-27 20:35:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:26,320 INFO L93 Difference]: Finished difference Result 15456 states and 48506 transitions. [2019-12-27 20:35:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:35:26,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:35:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:26,348 INFO L225 Difference]: With dead ends: 15456 [2019-12-27 20:35:26,348 INFO L226 Difference]: Without dead ends: 15317 [2019-12-27 20:35:26,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:35:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15317 states. [2019-12-27 20:35:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15317 to 14429. [2019-12-27 20:35:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14429 states. [2019-12-27 20:35:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14429 states to 14429 states and 45613 transitions. [2019-12-27 20:35:26,581 INFO L78 Accepts]: Start accepts. Automaton has 14429 states and 45613 transitions. Word has length 41 [2019-12-27 20:35:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:26,582 INFO L462 AbstractCegarLoop]: Abstraction has 14429 states and 45613 transitions. [2019-12-27 20:35:26,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14429 states and 45613 transitions. [2019-12-27 20:35:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:35:26,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:26,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:26,597 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 20:35:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash -381420262, now seen corresponding path program 1 times [2019-12-27 20:35:26,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:26,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889322623] [2019-12-27 20:35:26,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:26,732 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 20:35:26,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889322623] [2019-12-27 20:35:26,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:26,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:26,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895463646] [2019-12-27 20:35:26,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:26,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:27,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 317 states and 690 transitions. [2019-12-27 20:35:27,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:27,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:35:27,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:27,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:27,173 INFO L87 Difference]: Start difference. First operand 14429 states and 45613 transitions. Second operand 7 states. [2019-12-27 20:35:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:27,501 INFO L93 Difference]: Finished difference Result 31064 states and 97772 transitions. [2019-12-27 20:35:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:35:27,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 20:35:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:27,526 INFO L225 Difference]: With dead ends: 31064 [2019-12-27 20:35:27,526 INFO L226 Difference]: Without dead ends: 16294 [2019-12-27 20:35:27,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:35:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16294 states. [2019-12-27 20:35:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16294 to 12152. [2019-12-27 20:35:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12152 states. [2019-12-27 20:35:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12152 states to 12152 states and 38168 transitions. [2019-12-27 20:35:27,736 INFO L78 Accepts]: Start accepts. Automaton has 12152 states and 38168 transitions. Word has length 56 [2019-12-27 20:35:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:27,737 INFO L462 AbstractCegarLoop]: Abstraction has 12152 states and 38168 transitions. [2019-12-27 20:35:27,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 12152 states and 38168 transitions. [2019-12-27 20:35:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:35:27,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:27,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:27,753 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 20:35:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2143781782, now seen corresponding path program 2 times [2019-12-27 20:35:27,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:27,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960910855] [2019-12-27 20:35:27,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:28,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960910855] [2019-12-27 20:35:28,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:28,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:35:28,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527236822] [2019-12-27 20:35:28,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:28,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:28,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 354 transitions. [2019-12-27 20:35:28,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:29,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:35:29,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 20:35:29,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 20:35:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:35:29,319 INFO L87 Difference]: Start difference. First operand 12152 states and 38168 transitions. Second operand 24 states. [2019-12-27 20:35:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:35,990 INFO L93 Difference]: Finished difference Result 30895 states and 94894 transitions. [2019-12-27 20:35:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 20:35:35,991 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-12-27 20:35:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:36,019 INFO L225 Difference]: With dead ends: 30895 [2019-12-27 20:35:36,019 INFO L226 Difference]: Without dead ends: 19781 [2019-12-27 20:35:36,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 20:35:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19781 states. [2019-12-27 20:35:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19781 to 14000. [2019-12-27 20:35:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14000 states. [2019-12-27 20:35:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14000 states to 14000 states and 43779 transitions. [2019-12-27 20:35:36,259 INFO L78 Accepts]: Start accepts. Automaton has 14000 states and 43779 transitions. Word has length 56 [2019-12-27 20:35:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:36,259 INFO L462 AbstractCegarLoop]: Abstraction has 14000 states and 43779 transitions. [2019-12-27 20:35:36,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 20:35:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14000 states and 43779 transitions. [2019-12-27 20:35:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:35:36,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:36,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:36,275 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 20:35:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1014055824, now seen corresponding path program 3 times [2019-12-27 20:35:36,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:36,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531644233] [2019-12-27 20:35:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:36,974 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 20:35:36,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531644233] [2019-12-27 20:35:36,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:36,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:35:36,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556398408] [2019-12-27 20:35:36,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:36,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:37,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 363 transitions. [2019-12-27 20:35:37,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:37,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:35:37,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 20:35:37,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 20:35:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:35:37,969 INFO L87 Difference]: Start difference. First operand 14000 states and 43779 transitions. Second operand 26 states. [2019-12-27 20:35:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:49,601 INFO L93 Difference]: Finished difference Result 38022 states and 116587 transitions. [2019-12-27 20:35:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 20:35:49,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-12-27 20:35:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:49,644 INFO L225 Difference]: With dead ends: 38022 [2019-12-27 20:35:49,644 INFO L226 Difference]: Without dead ends: 27304 [2019-12-27 20:35:49,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=871, Invalid=4531, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 20:35:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27304 states. [2019-12-27 20:35:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27304 to 17279. [2019-12-27 20:35:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17279 states. [2019-12-27 20:35:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17279 states to 17279 states and 53973 transitions. [2019-12-27 20:35:50,140 INFO L78 Accepts]: Start accepts. Automaton has 17279 states and 53973 transitions. Word has length 56 [2019-12-27 20:35:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 17279 states and 53973 transitions. [2019-12-27 20:35:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 20:35:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 17279 states and 53973 transitions. [2019-12-27 20:35:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:35:50,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:50,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:50,159 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 20:35:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash 727818828, now seen corresponding path program 4 times [2019-12-27 20:35:50,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:50,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950811153] [2019-12-27 20:35:50,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:50,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950811153] [2019-12-27 20:35:50,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:50,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:35:50,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444291811] [2019-12-27 20:35:50,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:50,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:50,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 431 transitions. [2019-12-27 20:35:50,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:52,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 20:35:52,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 20:35:52,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 20:35:52,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:35:52,015 INFO L87 Difference]: Start difference. First operand 17279 states and 53973 transitions. Second operand 31 states. [2019-12-27 20:36:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:06,076 INFO L93 Difference]: Finished difference Result 43336 states and 132814 transitions. [2019-12-27 20:36:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 20:36:06,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-12-27 20:36:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:06,126 INFO L225 Difference]: With dead ends: 43336 [2019-12-27 20:36:06,126 INFO L226 Difference]: Without dead ends: 34512 [2019-12-27 20:36:06,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2455 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1148, Invalid=7042, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 20:36:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34512 states. [2019-12-27 20:36:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34512 to 20035. [2019-12-27 20:36:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20035 states. [2019-12-27 20:36:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20035 states to 20035 states and 62378 transitions. [2019-12-27 20:36:06,540 INFO L78 Accepts]: Start accepts. Automaton has 20035 states and 62378 transitions. Word has length 56 [2019-12-27 20:36:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:06,540 INFO L462 AbstractCegarLoop]: Abstraction has 20035 states and 62378 transitions. [2019-12-27 20:36:06,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 20:36:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20035 states and 62378 transitions. [2019-12-27 20:36:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:36:06,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:06,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:06,560 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 20:36:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash -626629072, now seen corresponding path program 5 times [2019-12-27 20:36:06,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:06,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867742295] [2019-12-27 20:36:06,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:07,221 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 20:36:07,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867742295] [2019-12-27 20:36:07,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:07,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:36:07,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799577372] [2019-12-27 20:36:07,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:07,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:07,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 479 transitions. [2019-12-27 20:36:07,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:09,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 46 times. [2019-12-27 20:36:09,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 20:36:09,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 20:36:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:36:09,236 INFO L87 Difference]: Start difference. First operand 20035 states and 62378 transitions. Second operand 32 states. [2019-12-27 20:36:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:27,653 INFO L93 Difference]: Finished difference Result 41735 states and 125852 transitions. [2019-12-27 20:36:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-27 20:36:27,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2019-12-27 20:36:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:27,708 INFO L225 Difference]: With dead ends: 41735 [2019-12-27 20:36:27,708 INFO L226 Difference]: Without dead ends: 38918 [2019-12-27 20:36:27,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 15 SyntacticMatches, 21 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5505 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1998, Invalid=14004, Unknown=0, NotChecked=0, Total=16002 [2019-12-27 20:36:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38918 states. [2019-12-27 20:36:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38918 to 20045. [2019-12-27 20:36:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20045 states. [2019-12-27 20:36:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20045 states to 20045 states and 62384 transitions. [2019-12-27 20:36:28,164 INFO L78 Accepts]: Start accepts. Automaton has 20045 states and 62384 transitions. Word has length 56 [2019-12-27 20:36:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:28,164 INFO L462 AbstractCegarLoop]: Abstraction has 20045 states and 62384 transitions. [2019-12-27 20:36:28,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 20:36:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20045 states and 62384 transitions. [2019-12-27 20:36:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:36:28,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:28,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:28,188 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 20:36:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash -942324032, now seen corresponding path program 6 times [2019-12-27 20:36:28,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:28,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78293087] [2019-12-27 20:36:28,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:28,852 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 20:36:28,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78293087] [2019-12-27 20:36:28,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:28,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:36:28,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487368507] [2019-12-27 20:36:28,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:28,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:29,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 445 transitions. [2019-12-27 20:36:29,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:31,088 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 48 times. [2019-12-27 20:36:31,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 20:36:31,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 20:36:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 20:36:31,090 INFO L87 Difference]: Start difference. First operand 20045 states and 62384 transitions. Second operand 36 states. [2019-12-27 20:36:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:50,834 INFO L93 Difference]: Finished difference Result 66096 states and 199437 transitions. [2019-12-27 20:36:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-27 20:36:50,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2019-12-27 20:36:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:50,917 INFO L225 Difference]: With dead ends: 66096 [2019-12-27 20:36:50,917 INFO L226 Difference]: Without dead ends: 56658 [2019-12-27 20:36:50,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 14 SyntacticMatches, 19 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7364 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2695, Invalid=18767, Unknown=0, NotChecked=0, Total=21462 [2019-12-27 20:36:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56658 states. [2019-12-27 20:36:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56658 to 20247. [2019-12-27 20:36:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2019-12-27 20:36:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 63035 transitions. [2019-12-27 20:36:51,692 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 63035 transitions. Word has length 56 [2019-12-27 20:36:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:51,692 INFO L462 AbstractCegarLoop]: Abstraction has 20247 states and 63035 transitions. [2019-12-27 20:36:51,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 20:36:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 63035 transitions. [2019-12-27 20:36:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:36:51,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:51,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:51,713 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 20:36:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 703526588, now seen corresponding path program 7 times [2019-12-27 20:36:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576735223] [2019-12-27 20:36:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:52,374 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 20:36:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576735223] [2019-12-27 20:36:52,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:52,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 20:36:52,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136109363] [2019-12-27 20:36:52,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:52,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:52,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 390 transitions. [2019-12-27 20:36:52,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:53,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 20:36:53,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 20:36:53,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 20:36:53,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:36:53,629 INFO L87 Difference]: Start difference. First operand 20247 states and 63035 transitions. Second operand 33 states. [2019-12-27 20:37:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:24,075 INFO L93 Difference]: Finished difference Result 56940 states and 171733 transitions. [2019-12-27 20:37:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-12-27 20:37:24,075 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2019-12-27 20:37:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:24,157 INFO L225 Difference]: With dead ends: 56940 [2019-12-27 20:37:24,158 INFO L226 Difference]: Without dead ends: 52670 [2019-12-27 20:37:24,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 19 SyntacticMatches, 22 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21620 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4935, Invalid=50525, Unknown=0, NotChecked=0, Total=55460 [2019-12-27 20:37:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52670 states. [2019-12-27 20:37:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52670 to 28450. [2019-12-27 20:37:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28450 states. [2019-12-27 20:37:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28450 states to 28450 states and 88089 transitions. [2019-12-27 20:37:24,972 INFO L78 Accepts]: Start accepts. Automaton has 28450 states and 88089 transitions. Word has length 56 [2019-12-27 20:37:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:24,973 INFO L462 AbstractCegarLoop]: Abstraction has 28450 states and 88089 transitions. [2019-12-27 20:37:24,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 20:37:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28450 states and 88089 transitions. [2019-12-27 20:37:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:37:25,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:25,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:25,007 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 20:37:25,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1651590828, now seen corresponding path program 8 times [2019-12-27 20:37:25,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:25,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842988665] [2019-12-27 20:37:25,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:25,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842988665] [2019-12-27 20:37:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:25,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:37:25,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933948455] [2019-12-27 20:37:25,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:25,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:25,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 367 transitions. [2019-12-27 20:37:25,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:26,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:26,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:26,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:26,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:27,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:27,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:27,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:27,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 20:37:27,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 20:37:27,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 20:37:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:37:27,768 INFO L87 Difference]: Start difference. First operand 28450 states and 88089 transitions. Second operand 43 states. [2019-12-27 20:37:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:50,280 INFO L93 Difference]: Finished difference Result 46936 states and 141481 transitions. [2019-12-27 20:37:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 20:37:50,280 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56 [2019-12-27 20:37:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:50,346 INFO L225 Difference]: With dead ends: 46936 [2019-12-27 20:37:50,346 INFO L226 Difference]: Without dead ends: 43682 [2019-12-27 20:37:50,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3141 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1536, Invalid=9176, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 20:37:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43682 states. [2019-12-27 20:37:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43682 to 28724. [2019-12-27 20:37:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28724 states. [2019-12-27 20:37:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28724 states to 28724 states and 88800 transitions. [2019-12-27 20:37:51,062 INFO L78 Accepts]: Start accepts. Automaton has 28724 states and 88800 transitions. Word has length 56 [2019-12-27 20:37:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:51,063 INFO L462 AbstractCegarLoop]: Abstraction has 28724 states and 88800 transitions. [2019-12-27 20:37:51,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 20:37:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28724 states and 88800 transitions. [2019-12-27 20:37:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:37:51,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:51,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:51,096 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 20:37:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2062407206, now seen corresponding path program 9 times [2019-12-27 20:37:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:51,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119123099] [2019-12-27 20:37:51,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:51,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119123099] [2019-12-27 20:37:51,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:51,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:37:51,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7774284] [2019-12-27 20:37:51,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:51,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:51,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 411 transitions. [2019-12-27 20:37:51,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:52,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:52,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:52,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:53,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 47 times. [2019-12-27 20:37:53,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 20:37:53,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 20:37:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:37:53,605 INFO L87 Difference]: Start difference. First operand 28724 states and 88800 transitions. Second operand 42 states. Received shutdown request... [2019-12-27 20:38:04,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 20:38:04,801 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 20:38:04,806 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 20:38:04,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:38:04 BasicIcfg [2019-12-27 20:38:04,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:38:04,808 INFO L168 Benchmark]: Toolchain (without parser) took 230248.72 ms. Allocated memory was 144.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,808 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.33 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 155.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,810 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,810 INFO L168 Benchmark]: RCFGBuilder took 794.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 104.1 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,811 INFO L168 Benchmark]: TraceAbstraction took 228569.07 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:38:04,814 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.33 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 155.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.96 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 104.1 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228569.07 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6628 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68107 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 (28724states) and FLOYD_HOARE automaton (currently 65 states, 42 states before enhancement),while ReachableStatesComputation was computing reachable states (5901 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 (28724states) and FLOYD_HOARE automaton (currently 65 states, 42 states before enhancement),while ReachableStatesComputation was computing reachable states (5901 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: TIMEOUT, OverallTime: 228.3s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 152.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6364 SDtfs, 13273 SDslu, 40598 SDs, 0 SdLazy, 93708 SolverSat, 1382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 162 SyntacticMatches, 166 SemanticMatches, 1036 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44832 ImplicationChecksByTransitivity, 48.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113136occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 241904 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 994 NumberOfCodeBlocks, 994 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 325611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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