/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:18:33,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:18:33,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:18:33,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:18:33,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:18:33,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:18:33,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:18:33,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:18:33,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:18:33,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:18:33,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:18:33,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:18:33,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:18:33,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:18:33,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:18:33,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:18:33,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:18:33,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:18:33,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:18:33,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:18:33,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:18:33,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:18:33,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:18:33,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:18:33,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:18:33,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:18:33,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:18:33,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:18:33,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:18:33,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:18:33,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:18:33,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:18:33,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:18:33,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:18:33,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:18:33,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:18:33,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:18:33,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:18:33,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:18:33,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:18:33,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:18:33,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 01:18:33,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:18:33,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:18:33,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:18:33,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:18:33,334 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:18:33,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:18:33,335 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:18:33,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:18:33,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:18:33,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:18:33,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:18:33,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:18:33,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:18:33,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:18:33,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:18:33,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:18:33,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:18:33,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:18:33,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:18:33,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:18:33,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:18:33,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:18:33,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:18:33,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:18:33,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:18:33,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:18:33,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:18:33,340 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:18:33,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:18:33,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:18:33,341 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:18:33,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:18:33,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:18:33,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:18:33,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:18:33,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:18:33,642 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:18:33,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-28 01:18:33,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7386ec555/43353f1fb1c04cae8a21089cfe7f3c4d/FLAGe606e7cc1 [2019-12-28 01:18:34,280 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:18:34,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-28 01:18:34,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7386ec555/43353f1fb1c04cae8a21089cfe7f3c4d/FLAGe606e7cc1 [2019-12-28 01:18:34,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7386ec555/43353f1fb1c04cae8a21089cfe7f3c4d [2019-12-28 01:18:34,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:18:34,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:18:34,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:18:34,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:18:34,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:18:34,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:18:34" (1/1) ... [2019-12-28 01:18:34,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:34, skipping insertion in model container [2019-12-28 01:18:34,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:18:34" (1/1) ... [2019-12-28 01:18:34,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:18:34,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:18:35,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:18:35,139 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:18:35,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:18:35,333 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:18:35,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35 WrapperNode [2019-12-28 01:18:35,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:18:35,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:18:35,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:18:35,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:18:35,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:18:35,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:18:35,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:18:35,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:18:35,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (1/1) ... [2019-12-28 01:18:35,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:18:35,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:18:35,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:18:35,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:18:35,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (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-28 01:18:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:18:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:18:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:18:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:18:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:18:35,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:18:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:18:35,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:18:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:18:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:18:35,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:18:35,532 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 01:18:36,486 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:18:36,486 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:18:36,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:18:36 BoogieIcfgContainer [2019-12-28 01:18:36,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:18:36,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:18:36,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:18:36,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:18:36,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:18:34" (1/3) ... [2019-12-28 01:18:36,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c39e1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:18:36, skipping insertion in model container [2019-12-28 01:18:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:35" (2/3) ... [2019-12-28 01:18:36,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c39e1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:18:36, skipping insertion in model container [2019-12-28 01:18:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:18:36" (3/3) ... [2019-12-28 01:18:36,496 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2019-12-28 01:18:36,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:18:36,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:18:36,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:18:36,519 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:18:36,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:36,641 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:18:36,662 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:18:36,662 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:18:36,662 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:18:36,662 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:18:36,662 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:18:36,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:18:36,663 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:18:36,663 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:18:36,678 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189 places, 244 transitions [2019-12-28 01:18:42,684 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 69535 states. [2019-12-28 01:18:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 69535 states. [2019-12-28 01:18:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 01:18:42,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:42,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:42,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2037423356, now seen corresponding path program 1 times [2019-12-28 01:18:42,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:42,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701318847] [2019-12-28 01:18:42,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:43,062 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-28 01:18:43,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701318847] [2019-12-28 01:18:43,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:43,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164452059] [2019-12-28 01:18:43,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:43,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:43,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 01:18:43,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:43,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:43,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:18:43,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:43,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:18:43,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:43,138 INFO L87 Difference]: Start difference. First operand 69535 states. Second operand 4 states. [2019-12-28 01:18:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:45,755 INFO L93 Difference]: Finished difference Result 70487 states and 288560 transitions. [2019-12-28 01:18:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:18:45,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-28 01:18:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:46,211 INFO L225 Difference]: With dead ends: 70487 [2019-12-28 01:18:46,211 INFO L226 Difference]: Without dead ends: 62935 [2019-12-28 01:18:46,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62935 states. [2019-12-28 01:18:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62935 to 62935. [2019-12-28 01:18:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62935 states. [2019-12-28 01:18:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62935 states to 62935 states and 260088 transitions. [2019-12-28 01:18:49,793 INFO L78 Accepts]: Start accepts. Automaton has 62935 states and 260088 transitions. Word has length 38 [2019-12-28 01:18:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:49,794 INFO L462 AbstractCegarLoop]: Abstraction has 62935 states and 260088 transitions. [2019-12-28 01:18:49,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:18:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62935 states and 260088 transitions. [2019-12-28 01:18:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 01:18:49,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:49,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:49,801 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -732865163, now seen corresponding path program 1 times [2019-12-28 01:18:49,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:49,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857956648] [2019-12-28 01:18:49,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:49,935 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-28 01:18:49,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857956648] [2019-12-28 01:18:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:18:49,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366653359] [2019-12-28 01:18:49,937 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:49,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:49,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 101 transitions. [2019-12-28 01:18:49,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:49,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:18:49,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:18:49,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:18:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:18:49,970 INFO L87 Difference]: Start difference. First operand 62935 states and 260088 transitions. Second operand 5 states. [2019-12-28 01:18:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:53,252 INFO L93 Difference]: Finished difference Result 102409 states and 395806 transitions. [2019-12-28 01:18:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:18:53,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 01:18:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:53,783 INFO L225 Difference]: With dead ends: 102409 [2019-12-28 01:18:53,783 INFO L226 Difference]: Without dead ends: 102265 [2019-12-28 01:18:53,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:18:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102265 states. [2019-12-28 01:18:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102265 to 100495. [2019-12-28 01:18:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100495 states. [2019-12-28 01:19:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100495 states to 100495 states and 389884 transitions. [2019-12-28 01:19:00,087 INFO L78 Accepts]: Start accepts. Automaton has 100495 states and 389884 transitions. Word has length 45 [2019-12-28 01:19:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:00,088 INFO L462 AbstractCegarLoop]: Abstraction has 100495 states and 389884 transitions. [2019-12-28 01:19:00,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:19:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100495 states and 389884 transitions. [2019-12-28 01:19:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 01:19:00,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:00,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:00,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1014394504, now seen corresponding path program 1 times [2019-12-28 01:19:00,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:00,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615784233] [2019-12-28 01:19:00,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:00,198 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-28 01:19:00,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615784233] [2019-12-28 01:19:00,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:00,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:19:00,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382845995] [2019-12-28 01:19:00,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:00,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:00,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 01:19:00,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:00,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:00,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:19:00,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:19:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:19:00,209 INFO L87 Difference]: Start difference. First operand 100495 states and 389884 transitions. Second operand 5 states. [2019-12-28 01:19:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:05,132 INFO L93 Difference]: Finished difference Result 123001 states and 468917 transitions. [2019-12-28 01:19:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:19:05,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 01:19:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:05,580 INFO L225 Difference]: With dead ends: 123001 [2019-12-28 01:19:05,580 INFO L226 Difference]: Without dead ends: 122841 [2019-12-28 01:19:05,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:19:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122841 states. [2019-12-28 01:19:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122841 to 109850. [2019-12-28 01:19:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109850 states. [2019-12-28 01:19:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109850 states to 109850 states and 422838 transitions. [2019-12-28 01:19:09,222 INFO L78 Accepts]: Start accepts. Automaton has 109850 states and 422838 transitions. Word has length 46 [2019-12-28 01:19:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:09,223 INFO L462 AbstractCegarLoop]: Abstraction has 109850 states and 422838 transitions. [2019-12-28 01:19:09,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:19:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109850 states and 422838 transitions. [2019-12-28 01:19:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:19:09,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:09,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:09,240 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1194169133, now seen corresponding path program 1 times [2019-12-28 01:19:09,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:09,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961561412] [2019-12-28 01:19:09,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:09,338 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-28 01:19:09,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961561412] [2019-12-28 01:19:09,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:09,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:19:09,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693098549] [2019-12-28 01:19:09,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:09,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:09,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 179 transitions. [2019-12-28 01:19:09,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:09,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:19:09,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:19:09,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:19:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:19:09,369 INFO L87 Difference]: Start difference. First operand 109850 states and 422838 transitions. Second operand 6 states. [2019-12-28 01:19:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:15,238 INFO L93 Difference]: Finished difference Result 145202 states and 544226 transitions. [2019-12-28 01:19:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:19:15,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 01:19:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:15,629 INFO L225 Difference]: With dead ends: 145202 [2019-12-28 01:19:15,630 INFO L226 Difference]: Without dead ends: 145058 [2019-12-28 01:19:15,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:19:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145058 states. [2019-12-28 01:19:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145058 to 108813. [2019-12-28 01:19:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108813 states. [2019-12-28 01:19:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108813 states to 108813 states and 418993 transitions. [2019-12-28 01:19:19,421 INFO L78 Accepts]: Start accepts. Automaton has 108813 states and 418993 transitions. Word has length 53 [2019-12-28 01:19:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:19,422 INFO L462 AbstractCegarLoop]: Abstraction has 108813 states and 418993 transitions. [2019-12-28 01:19:19,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:19:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 108813 states and 418993 transitions. [2019-12-28 01:19:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 01:19:19,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:19,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:19,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 16392352, now seen corresponding path program 1 times [2019-12-28 01:19:19,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:19,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108871507] [2019-12-28 01:19:19,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:19,561 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-28 01:19:19,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108871507] [2019-12-28 01:19:19,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:19,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:19:19,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957746036] [2019-12-28 01:19:19,564 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:19,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:19,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 01:19:19,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:19,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:19,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:19:19,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:19:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:19:19,583 INFO L87 Difference]: Start difference. First operand 108813 states and 418993 transitions. Second operand 6 states. [2019-12-28 01:19:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:20,937 INFO L93 Difference]: Finished difference Result 145663 states and 546005 transitions. [2019-12-28 01:19:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:19:20,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 01:19:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:22,416 INFO L225 Difference]: With dead ends: 145663 [2019-12-28 01:19:22,416 INFO L226 Difference]: Without dead ends: 145423 [2019-12-28 01:19:22,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:19:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145423 states. [2019-12-28 01:19:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145423 to 130402. [2019-12-28 01:19:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130402 states. [2019-12-28 01:19:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130402 states to 130402 states and 494392 transitions. [2019-12-28 01:19:33,129 INFO L78 Accepts]: Start accepts. Automaton has 130402 states and 494392 transitions. Word has length 60 [2019-12-28 01:19:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:33,129 INFO L462 AbstractCegarLoop]: Abstraction has 130402 states and 494392 transitions. [2019-12-28 01:19:33,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:19:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 130402 states and 494392 transitions. [2019-12-28 01:19:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 01:19:33,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:33,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:33,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -559968746, now seen corresponding path program 1 times [2019-12-28 01:19:33,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:33,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954047824] [2019-12-28 01:19:33,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:33,246 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-28 01:19:33,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954047824] [2019-12-28 01:19:33,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:33,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:19:33,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140054256] [2019-12-28 01:19:33,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:33,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:33,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 01:19:33,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:33,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:33,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:19:33,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:19:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:19:33,268 INFO L87 Difference]: Start difference. First operand 130402 states and 494392 transitions. Second operand 3 states. [2019-12-28 01:19:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:34,254 INFO L93 Difference]: Finished difference Result 210818 states and 777868 transitions. [2019-12-28 01:19:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:19:34,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-28 01:19:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:35,561 INFO L225 Difference]: With dead ends: 210818 [2019-12-28 01:19:35,561 INFO L226 Difference]: Without dead ends: 210818 [2019-12-28 01:19:35,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:19:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210818 states. [2019-12-28 01:19:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210818 to 187534. [2019-12-28 01:19:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187534 states. [2019-12-28 01:19:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187534 states to 187534 states and 695635 transitions. [2019-12-28 01:19:46,245 INFO L78 Accepts]: Start accepts. Automaton has 187534 states and 695635 transitions. Word has length 62 [2019-12-28 01:19:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:46,245 INFO L462 AbstractCegarLoop]: Abstraction has 187534 states and 695635 transitions. [2019-12-28 01:19:46,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:19:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 187534 states and 695635 transitions. [2019-12-28 01:19:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 01:19:46,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:46,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:46,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash -236904236, now seen corresponding path program 1 times [2019-12-28 01:19:46,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:46,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472839648] [2019-12-28 01:19:46,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:46,462 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-28 01:19:46,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472839648] [2019-12-28 01:19:46,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:46,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:19:46,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998999208] [2019-12-28 01:19:46,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:46,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:46,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 01:19:46,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:46,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:46,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:19:46,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:19:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:19:46,494 INFO L87 Difference]: Start difference. First operand 187534 states and 695635 transitions. Second operand 7 states. [2019-12-28 01:19:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:53,860 INFO L93 Difference]: Finished difference Result 242757 states and 879896 transitions. [2019-12-28 01:19:53,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 01:19:53,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 01:19:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:54,520 INFO L225 Difference]: With dead ends: 242757 [2019-12-28 01:19:54,521 INFO L226 Difference]: Without dead ends: 242517 [2019-12-28 01:19:54,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:19:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242517 states. [2019-12-28 01:20:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242517 to 189100. [2019-12-28 01:20:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189100 states. [2019-12-28 01:20:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189100 states to 189100 states and 700966 transitions. [2019-12-28 01:20:01,052 INFO L78 Accepts]: Start accepts. Automaton has 189100 states and 700966 transitions. Word has length 66 [2019-12-28 01:20:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:20:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 189100 states and 700966 transitions. [2019-12-28 01:20:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:20:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 189100 states and 700966 transitions. [2019-12-28 01:20:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:20:02,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:20:02,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:20:02,512 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:20:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:20:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1121550149, now seen corresponding path program 1 times [2019-12-28 01:20:02,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:20:02,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671242781] [2019-12-28 01:20:02,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:20:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:20:02,674 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-28 01:20:02,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671242781] [2019-12-28 01:20:02,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:20:02,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:20:02,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671648210] [2019-12-28 01:20:02,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:20:02,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:20:02,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 191 transitions. [2019-12-28 01:20:02,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:20:02,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:20:02,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:20:02,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:20:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:20:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:20:02,721 INFO L87 Difference]: Start difference. First operand 189100 states and 700966 transitions. Second operand 7 states. [2019-12-28 01:20:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:20:11,696 INFO L93 Difference]: Finished difference Result 251310 states and 908176 transitions. [2019-12-28 01:20:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 01:20:11,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 01:20:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:20:12,405 INFO L225 Difference]: With dead ends: 251310 [2019-12-28 01:20:12,406 INFO L226 Difference]: Without dead ends: 251110 [2019-12-28 01:20:12,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-28 01:20:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251110 states. [2019-12-28 01:20:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251110 to 198330. [2019-12-28 01:20:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198330 states. [2019-12-28 01:20:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198330 states to 198330 states and 732648 transitions. [2019-12-28 01:20:18,868 INFO L78 Accepts]: Start accepts. Automaton has 198330 states and 732648 transitions. Word has length 67 [2019-12-28 01:20:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:20:18,868 INFO L462 AbstractCegarLoop]: Abstraction has 198330 states and 732648 transitions. [2019-12-28 01:20:18,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:20:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 198330 states and 732648 transitions. [2019-12-28 01:20:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:20:20,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:20:20,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:20:20,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:20:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:20:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1097892619, now seen corresponding path program 1 times [2019-12-28 01:20:20,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:20:20,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448203258] [2019-12-28 01:20:20,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:20:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:20:20,193 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-28 01:20:20,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448203258] [2019-12-28 01:20:20,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:20:20,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:20:20,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898740279] [2019-12-28 01:20:20,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:20:20,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:20:20,217 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 01:20:20,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:20:20,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:20:20,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:20:20,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:20:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:20:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:20:20,219 INFO L87 Difference]: Start difference. First operand 198330 states and 732648 transitions. Second operand 6 states. [2019-12-28 01:20:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:20:28,483 INFO L93 Difference]: Finished difference Result 275504 states and 1015214 transitions. [2019-12-28 01:20:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:20:28,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 01:20:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:20:29,281 INFO L225 Difference]: With dead ends: 275504 [2019-12-28 01:20:29,281 INFO L226 Difference]: Without dead ends: 275504 [2019-12-28 01:20:29,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:20:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275504 states. [2019-12-28 01:20:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275504 to 236435. [2019-12-28 01:20:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236435 states. [2019-12-28 01:20:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236435 states to 236435 states and 875017 transitions. [2019-12-28 01:20:37,082 INFO L78 Accepts]: Start accepts. Automaton has 236435 states and 875017 transitions. Word has length 69 [2019-12-28 01:20:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:20:37,083 INFO L462 AbstractCegarLoop]: Abstraction has 236435 states and 875017 transitions. [2019-12-28 01:20:37,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:20:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 236435 states and 875017 transitions. [2019-12-28 01:20:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:20:37,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:20:37,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:20:37,215 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:20:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:20:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2059506636, now seen corresponding path program 1 times [2019-12-28 01:20:37,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:20:37,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247487110] [2019-12-28 01:20:37,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:20:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:20:37,320 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-28 01:20:37,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247487110] [2019-12-28 01:20:37,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:20:37,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:20:37,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381204515] [2019-12-28 01:20:37,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:20:37,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:20:37,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 01:20:37,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:20:37,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:20:37,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:20:37,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:20:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:20:37,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:20:37,340 INFO L87 Difference]: Start difference. First operand 236435 states and 875017 transitions. Second operand 7 states. [2019-12-28 01:20:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:20:45,472 INFO L93 Difference]: Finished difference Result 332957 states and 1206203 transitions. [2019-12-28 01:20:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:20:45,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 01:20:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:20:47,130 INFO L225 Difference]: With dead ends: 332957 [2019-12-28 01:20:47,130 INFO L226 Difference]: Without dead ends: 332957 [2019-12-28 01:20:47,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:20:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332957 states. [2019-12-28 01:20:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332957 to 310971. [2019-12-28 01:20:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310971 states. [2019-12-28 01:21:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310971 states to 310971 states and 1133528 transitions. [2019-12-28 01:21:08,228 INFO L78 Accepts]: Start accepts. Automaton has 310971 states and 1133528 transitions. Word has length 69 [2019-12-28 01:21:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:08,228 INFO L462 AbstractCegarLoop]: Abstraction has 310971 states and 1133528 transitions. [2019-12-28 01:21:08,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:21:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 310971 states and 1133528 transitions. [2019-12-28 01:21:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:21:08,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:08,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:08,427 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash -990696179, now seen corresponding path program 1 times [2019-12-28 01:21:08,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:08,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923107690] [2019-12-28 01:21:08,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:08,531 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-28 01:21:08,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923107690] [2019-12-28 01:21:08,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:08,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:21:08,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751175244] [2019-12-28 01:21:08,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:08,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:08,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 01:21:08,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:08,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:21:08,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:21:08,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:21:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:21:08,569 INFO L87 Difference]: Start difference. First operand 310971 states and 1133528 transitions. Second operand 4 states. [2019-12-28 01:21:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:08,803 INFO L93 Difference]: Finished difference Result 48146 states and 153495 transitions. [2019-12-28 01:21:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:21:08,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 01:21:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:08,891 INFO L225 Difference]: With dead ends: 48146 [2019-12-28 01:21:08,892 INFO L226 Difference]: Without dead ends: 46262 [2019-12-28 01:21:08,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 01:21:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46262 states. [2019-12-28 01:21:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46262 to 46188. [2019-12-28 01:21:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46188 states. [2019-12-28 01:21:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46188 states to 46188 states and 147141 transitions. [2019-12-28 01:21:16,335 INFO L78 Accepts]: Start accepts. Automaton has 46188 states and 147141 transitions. Word has length 69 [2019-12-28 01:21:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:16,335 INFO L462 AbstractCegarLoop]: Abstraction has 46188 states and 147141 transitions. [2019-12-28 01:21:16,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:21:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46188 states and 147141 transitions. [2019-12-28 01:21:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 01:21:16,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:16,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:16,358 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:16,359 INFO L82 PathProgramCache]: Analyzing trace with hash -862800569, now seen corresponding path program 1 times [2019-12-28 01:21:16,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:16,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745975697] [2019-12-28 01:21:16,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:16,418 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-28 01:21:16,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745975697] [2019-12-28 01:21:16,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:16,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:21:16,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552602145] [2019-12-28 01:21:16,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:16,436 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:16,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 01:21:16,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:16,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:21:16,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:21:16,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:21:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:21:16,560 INFO L87 Difference]: Start difference. First operand 46188 states and 147141 transitions. Second operand 6 states. [2019-12-28 01:21:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:17,294 INFO L93 Difference]: Finished difference Result 55992 states and 176874 transitions. [2019-12-28 01:21:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:21:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-12-28 01:21:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:17,395 INFO L225 Difference]: With dead ends: 55992 [2019-12-28 01:21:17,395 INFO L226 Difference]: Without dead ends: 55992 [2019-12-28 01:21:17,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:21:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55992 states. [2019-12-28 01:21:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55992 to 49593. [2019-12-28 01:21:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49593 states. [2019-12-28 01:21:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49593 states to 49593 states and 157329 transitions. [2019-12-28 01:21:18,583 INFO L78 Accepts]: Start accepts. Automaton has 49593 states and 157329 transitions. Word has length 79 [2019-12-28 01:21:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:18,583 INFO L462 AbstractCegarLoop]: Abstraction has 49593 states and 157329 transitions. [2019-12-28 01:21:18,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:21:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49593 states and 157329 transitions. [2019-12-28 01:21:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 01:21:18,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:18,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:18,609 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1117537114, now seen corresponding path program 1 times [2019-12-28 01:21:18,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:18,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737673849] [2019-12-28 01:21:18,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:21:18,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737673849] [2019-12-28 01:21:18,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:18,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:21:18,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771649766] [2019-12-28 01:21:18,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:18,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:18,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 01:21:18,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:18,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:21:18,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:21:18,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:21:18,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:21:18,773 INFO L87 Difference]: Start difference. First operand 49593 states and 157329 transitions. Second operand 8 states. [2019-12-28 01:21:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:20,919 INFO L93 Difference]: Finished difference Result 56799 states and 178120 transitions. [2019-12-28 01:21:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 01:21:20,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-12-28 01:21:20,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:21,096 INFO L225 Difference]: With dead ends: 56799 [2019-12-28 01:21:21,096 INFO L226 Difference]: Without dead ends: 56751 [2019-12-28 01:21:21,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-28 01:21:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56751 states. [2019-12-28 01:21:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56751 to 44460. [2019-12-28 01:21:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44460 states. [2019-12-28 01:21:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44460 states to 44460 states and 141688 transitions. [2019-12-28 01:21:22,920 INFO L78 Accepts]: Start accepts. Automaton has 44460 states and 141688 transitions. Word has length 79 [2019-12-28 01:21:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:22,921 INFO L462 AbstractCegarLoop]: Abstraction has 44460 states and 141688 transitions. [2019-12-28 01:21:22,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:21:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 44460 states and 141688 transitions. [2019-12-28 01:21:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:21:22,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:22,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:22,967 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1830659350, now seen corresponding path program 1 times [2019-12-28 01:21:22,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:22,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842782050] [2019-12-28 01:21:22,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:23,050 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-28 01:21:23,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842782050] [2019-12-28 01:21:23,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:23,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:21:23,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [240520787] [2019-12-28 01:21:23,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:23,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:23,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 90 transitions. [2019-12-28 01:21:23,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:23,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:21:23,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:21:23,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:23,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:21:23,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:21:23,137 INFO L87 Difference]: Start difference. First operand 44460 states and 141688 transitions. Second operand 3 states. [2019-12-28 01:21:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:23,553 INFO L93 Difference]: Finished difference Result 45984 states and 146029 transitions. [2019-12-28 01:21:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:21:23,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-28 01:21:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:23,627 INFO L225 Difference]: With dead ends: 45984 [2019-12-28 01:21:23,628 INFO L226 Difference]: Without dead ends: 45984 [2019-12-28 01:21:23,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:21:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45984 states. [2019-12-28 01:21:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45984 to 45180. [2019-12-28 01:21:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45180 states. [2019-12-28 01:21:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45180 states to 45180 states and 143754 transitions. [2019-12-28 01:21:24,265 INFO L78 Accepts]: Start accepts. Automaton has 45180 states and 143754 transitions. Word has length 80 [2019-12-28 01:21:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:24,265 INFO L462 AbstractCegarLoop]: Abstraction has 45180 states and 143754 transitions. [2019-12-28 01:21:24,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:21:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 45180 states and 143754 transitions. [2019-12-28 01:21:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 01:21:24,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:24,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:24,516 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1027936206, now seen corresponding path program 1 times [2019-12-28 01:21:24,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:24,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674723261] [2019-12-28 01:21:24,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:24,587 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-28 01:21:24,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674723261] [2019-12-28 01:21:24,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:24,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:21:24,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [525803321] [2019-12-28 01:21:24,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:24,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:24,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 01:21:24,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:24,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:21:24,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:21:24,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:21:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:21:24,638 INFO L87 Difference]: Start difference. First operand 45180 states and 143754 transitions. Second operand 7 states. [2019-12-28 01:21:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:26,182 INFO L93 Difference]: Finished difference Result 91592 states and 289557 transitions. [2019-12-28 01:21:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 01:21:26,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 01:21:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:26,361 INFO L225 Difference]: With dead ends: 91592 [2019-12-28 01:21:26,361 INFO L226 Difference]: Without dead ends: 91352 [2019-12-28 01:21:26,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:21:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91352 states. [2019-12-28 01:21:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91352 to 50959. [2019-12-28 01:21:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50959 states. [2019-12-28 01:21:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50959 states to 50959 states and 161075 transitions. [2019-12-28 01:21:27,719 INFO L78 Accepts]: Start accepts. Automaton has 50959 states and 161075 transitions. Word has length 82 [2019-12-28 01:21:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:27,719 INFO L462 AbstractCegarLoop]: Abstraction has 50959 states and 161075 transitions. [2019-12-28 01:21:27,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:21:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 50959 states and 161075 transitions. [2019-12-28 01:21:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 01:21:27,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:27,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:27,751 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash 698170445, now seen corresponding path program 1 times [2019-12-28 01:21:27,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:27,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837450083] [2019-12-28 01:21:27,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:27,832 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-28 01:21:27,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837450083] [2019-12-28 01:21:27,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:27,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:21:27,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685089800] [2019-12-28 01:21:27,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:27,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:27,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 01:21:27,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:27,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:21:27,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:21:27,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:21:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:21:27,883 INFO L87 Difference]: Start difference. First operand 50959 states and 161075 transitions. Second operand 6 states. [2019-12-28 01:21:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:29,253 INFO L93 Difference]: Finished difference Result 69497 states and 216709 transitions. [2019-12-28 01:21:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:21:29,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-28 01:21:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:29,375 INFO L225 Difference]: With dead ends: 69497 [2019-12-28 01:21:29,375 INFO L226 Difference]: Without dead ends: 69095 [2019-12-28 01:21:29,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:21:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2019-12-28 01:21:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 57563. [2019-12-28 01:21:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57563 states. [2019-12-28 01:21:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57563 states to 57563 states and 181582 transitions. [2019-12-28 01:21:30,665 INFO L78 Accepts]: Start accepts. Automaton has 57563 states and 181582 transitions. Word has length 82 [2019-12-28 01:21:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:30,666 INFO L462 AbstractCegarLoop]: Abstraction has 57563 states and 181582 transitions. [2019-12-28 01:21:30,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:21:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 57563 states and 181582 transitions. [2019-12-28 01:21:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 01:21:30,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:30,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:30,702 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1659784462, now seen corresponding path program 1 times [2019-12-28 01:21:30,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:30,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115225250] [2019-12-28 01:21:30,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:30,793 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-28 01:21:30,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115225250] [2019-12-28 01:21:30,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:30,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:21:30,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341242024] [2019-12-28 01:21:30,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:30,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:30,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 01:21:30,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:30,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:21:30,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:21:30,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:21:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:21:30,856 INFO L87 Difference]: Start difference. First operand 57563 states and 181582 transitions. Second operand 7 states. [2019-12-28 01:21:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:33,034 INFO L93 Difference]: Finished difference Result 82928 states and 255685 transitions. [2019-12-28 01:21:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 01:21:33,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 01:21:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:33,182 INFO L225 Difference]: With dead ends: 82928 [2019-12-28 01:21:33,183 INFO L226 Difference]: Without dead ends: 82856 [2019-12-28 01:21:33,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:21:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82856 states. [2019-12-28 01:21:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82856 to 64098. [2019-12-28 01:21:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64098 states. [2019-12-28 01:21:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 200126 transitions. [2019-12-28 01:21:34,863 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 200126 transitions. Word has length 82 [2019-12-28 01:21:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:34,863 INFO L462 AbstractCegarLoop]: Abstraction has 64098 states and 200126 transitions. [2019-12-28 01:21:34,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:21:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 200126 transitions. [2019-12-28 01:21:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 01:21:34,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:34,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:21:34,910 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 105252623, now seen corresponding path program 1 times [2019-12-28 01:21:34,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:34,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667486170] [2019-12-28 01:21:34,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:35,013 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-28 01:21:35,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667486170] [2019-12-28 01:21:35,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:35,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:21:35,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138438350] [2019-12-28 01:21:35,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:35,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:35,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 01:21:35,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:35,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:21:35,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:21:35,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:21:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:21:35,071 INFO L87 Difference]: Start difference. First operand 64098 states and 200126 transitions. Second operand 8 states. [2019-12-28 01:21:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:21:37,736 INFO L93 Difference]: Finished difference Result 84556 states and 259945 transitions. [2019-12-28 01:21:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 01:21:37,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-28 01:21:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:21:37,884 INFO L225 Difference]: With dead ends: 84556 [2019-12-28 01:21:37,884 INFO L226 Difference]: Without dead ends: 84253 [2019-12-28 01:21:37,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:21:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84253 states. [2019-12-28 01:21:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84253 to 60255. [2019-12-28 01:21:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2019-12-28 01:21:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 187468 transitions. [2019-12-28 01:21:39,347 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 187468 transitions. Word has length 82 [2019-12-28 01:21:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:21:39,347 INFO L462 AbstractCegarLoop]: Abstraction has 60255 states and 187468 transitions. [2019-12-28 01:21:39,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:21:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 187468 transitions. [2019-12-28 01:21:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 01:21:39,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:21:39,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:21:39,387 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:21:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:21:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1983336175, now seen corresponding path program 1 times [2019-12-28 01:21:39,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:21:39,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842802280] [2019-12-28 01:21:39,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:21:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:21:39,486 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-28 01:21:39,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842802280] [2019-12-28 01:21:39,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:21:39,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:21:39,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228152693] [2019-12-28 01:21:39,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:21:39,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:21:39,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 01:21:39,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:21:39,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:21:39,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:21:39,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:21:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:21:39,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:21:39,541 INFO L87 Difference]: Start difference. First operand 60255 states and 187468 transitions. Second operand 8 states. Received shutdown request... [2019-12-28 01:21:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 01:21:40,634 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 01:21:40,642 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 01:21:40,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:21:40 BasicIcfg [2019-12-28 01:21:40,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:21:40,644 INFO L168 Benchmark]: Toolchain (without parser) took 186089.93 ms. Allocated memory was 138.4 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,645 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.44 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,647 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,647 INFO L168 Benchmark]: RCFGBuilder took 1041.27 ms. Allocated memory is still 202.9 MB. Free memory was 149.1 MB in the beginning and 92.7 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,648 INFO L168 Benchmark]: TraceAbstraction took 184152.98 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 92.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-28 01:21:40,651 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.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.44 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.66 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1041.27 ms. Allocated memory is still 202.9 MB. Free memory was 149.1 MB in the beginning and 92.7 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184152.98 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 92.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (60255states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (8359 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (60255states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (8359 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: TIMEOUT, OverallTime: 183.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 73.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11007 SDtfs, 13338 SDslu, 27063 SDs, 0 SdLazy, 13462 SolverSat, 777 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310971occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 97.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 370812 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 202697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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