/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:23:38,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:23:38,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:23:38,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:23:38,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:23:38,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:23:38,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:23:38,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:23:38,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:23:38,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:23:38,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:23:38,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:23:38,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:23:38,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:23:38,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:23:38,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:23:38,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:23:38,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:23:38,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:23:38,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:23:38,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:23:38,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:23:38,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:23:38,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:23:38,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:23:38,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:23:38,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:23:38,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:23:38,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:23:38,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:23:38,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:23:38,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:23:38,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:23:38,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:23:38,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:23:38,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:23:38,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:23:38,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:23:38,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:23:38,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:23:38,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:23:38,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:23:38,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:23:38,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:23:38,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:23:38,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:23:38,343 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:23:38,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:23:38,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:23:38,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:23:38,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:23:38,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:23:38,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:23:38,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:23:38,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:23:38,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:23:38,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:23:38,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:23:38,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:23:38,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:23:38,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:23:38,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:23:38,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:23:38,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:23:38,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:23:38,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:23:38,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:23:38,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:23:38,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:23:38,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:23:38,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:23:38,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:23:38,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:23:38,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:23:38,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:23:38,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:23:38,658 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:23:38,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 14:23:38,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175b7783e/8f1b7a8136994bffbece09178b568d9d/FLAG5ec3896c9 [2019-12-18 14:23:39,319 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:23:39,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 14:23:39,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175b7783e/8f1b7a8136994bffbece09178b568d9d/FLAG5ec3896c9 [2019-12-18 14:23:39,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175b7783e/8f1b7a8136994bffbece09178b568d9d [2019-12-18 14:23:39,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:23:39,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:23:39,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:23:39,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:23:39,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:23:39,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:23:39" (1/1) ... [2019-12-18 14:23:39,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:39, skipping insertion in model container [2019-12-18 14:23:39,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:23:39" (1/1) ... [2019-12-18 14:23:39,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:23:39,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:23:40,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:23:40,260 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:23:40,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:23:40,428 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:23:40,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40 WrapperNode [2019-12-18 14:23:40,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:23:40,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:23:40,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:23:40,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:23:40,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:23:40,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:23:40,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:23:40,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:23:40,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... [2019-12-18 14:23:40,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:23:40,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:23:40,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:23:40,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:23:40,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:23:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:23:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:23:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:23:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:23:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:23:40,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:23:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:23:40,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:23:40,619 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:23:40,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:23:40,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:23:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:23:40,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:23:40,622 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:23:41,366 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:23:41,367 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:23:41,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:23:41 BoogieIcfgContainer [2019-12-18 14:23:41,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:23:41,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:23:41,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:23:41,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:23:41,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:23:39" (1/3) ... [2019-12-18 14:23:41,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191abe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:23:41, skipping insertion in model container [2019-12-18 14:23:41,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:23:40" (2/3) ... [2019-12-18 14:23:41,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191abe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:23:41, skipping insertion in model container [2019-12-18 14:23:41,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:23:41" (3/3) ... [2019-12-18 14:23:41,383 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-18 14:23:41,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:23:41,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:23:41,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:23:41,407 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:23:41,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,544 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,544 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:23:41,586 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:23:41,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:23:41,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:23:41,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:23:41,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:23:41,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:23:41,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:23:41,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:23:41,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:23:41,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:23:41,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:23:41,719 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:23:41,719 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:23:41,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:23:41,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:23:41,857 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:23:41,858 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:23:41,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:23:41,891 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:23:41,893 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:23:47,546 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:23:47,673 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:23:47,698 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-18 14:23:47,699 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 14:23:47,703 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 14:23:57,922 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-18 14:23:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-18 14:23:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:23:57,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:23:57,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:23:57,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:23:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:23:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-18 14:23:57,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:23:57,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325353817] [2019-12-18 14:23:57,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:23:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:23:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:23:58,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325353817] [2019-12-18 14:23:58,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:23:58,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:23:58,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927941611] [2019-12-18 14:23:58,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:23:58,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:23:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:23:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:23:58,265 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-18 14:24:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:00,694 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-18 14:24:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:00,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:24:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:01,242 INFO L225 Difference]: With dead ends: 79498 [2019-12-18 14:24:01,242 INFO L226 Difference]: Without dead ends: 74626 [2019-12-18 14:24:01,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-18 14:24:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-18 14:24:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-18 14:24:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-18 14:24:08,266 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-18 14:24:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:08,266 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-18 14:24:08,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-18 14:24:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:24:08,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:08,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:08,278 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-18 14:24:08,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:08,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155660066] [2019-12-18 14:24:08,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155660066] [2019-12-18 14:24:08,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:08,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:24:08,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584003012] [2019-12-18 14:24:08,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:08,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:08,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:08,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:08,385 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-18 14:24:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:08,551 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-18 14:24:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:08,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:24:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:08,634 INFO L225 Difference]: With dead ends: 19918 [2019-12-18 14:24:08,634 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 14:24:08,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 14:24:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-18 14:24:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-18 14:24:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-18 14:24:12,072 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-18 14:24:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:12,072 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-18 14:24:12,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-18 14:24:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:24:12,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:12,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:12,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-18 14:24:12,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:12,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158778595] [2019-12-18 14:24:12,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158778595] [2019-12-18 14:24:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:24:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780972898] [2019-12-18 14:24:12,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:24:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:24:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:24:12,196 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-18 14:24:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:12,601 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-18 14:24:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:24:12,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:24:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:12,666 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 14:24:12,667 INFO L226 Difference]: Without dead ends: 29589 [2019-12-18 14:24:12,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-18 14:24:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-18 14:24:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-18 14:24:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-18 14:24:13,586 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-18 14:24:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:13,587 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-18 14:24:13,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:24:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-18 14:24:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:24:13,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:13,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:13,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-18 14:24:13,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:13,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102853093] [2019-12-18 14:24:13,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:13,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102853093] [2019-12-18 14:24:13,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:13,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:24:13,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910891119] [2019-12-18 14:24:13,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:24:13,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:24:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:13,749 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-18 14:24:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:14,312 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-18 14:24:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:24:14,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:24:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:14,751 INFO L225 Difference]: With dead ends: 40028 [2019-12-18 14:24:14,751 INFO L226 Difference]: Without dead ends: 40010 [2019-12-18 14:24:14,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:24:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-18 14:24:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-18 14:24:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-18 14:24:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-18 14:24:15,388 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-18 14:24:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:15,389 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-18 14:24:15,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:24:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-18 14:24:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:24:15,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:15,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:15,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-18 14:24:15,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:15,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192533231] [2019-12-18 14:24:15,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:15,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192533231] [2019-12-18 14:24:15,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:15,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:24:15,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065691373] [2019-12-18 14:24:15,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:24:15,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:24:15,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:24:15,527 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-18 14:24:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:16,428 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-18 14:24:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:24:16,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:24:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:16,528 INFO L225 Difference]: With dead ends: 54414 [2019-12-18 14:24:16,528 INFO L226 Difference]: Without dead ends: 54384 [2019-12-18 14:24:16,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:24:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-18 14:24:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-18 14:24:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-18 14:24:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-18 14:24:17,623 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-18 14:24:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:17,623 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-18 14:24:17,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:24:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-18 14:24:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:24:17,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:17,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:17,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-18 14:24:17,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:17,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29144871] [2019-12-18 14:24:17,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:17,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29144871] [2019-12-18 14:24:17,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:17,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:24:17,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575082435] [2019-12-18 14:24:17,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:24:17,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:24:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:24:17,783 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-18 14:24:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:18,801 INFO L93 Difference]: Finished difference Result 56211 states and 182423 transitions. [2019-12-18 14:24:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:24:18,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 14:24:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:18,943 INFO L225 Difference]: With dead ends: 56211 [2019-12-18 14:24:18,943 INFO L226 Difference]: Without dead ends: 56181 [2019-12-18 14:24:18,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:24:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56181 states. [2019-12-18 14:24:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56181 to 35539. [2019-12-18 14:24:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35539 states. [2019-12-18 14:24:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35539 states to 35539 states and 117693 transitions. [2019-12-18 14:24:20,072 INFO L78 Accepts]: Start accepts. Automaton has 35539 states and 117693 transitions. Word has length 22 [2019-12-18 14:24:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:20,073 INFO L462 AbstractCegarLoop]: Abstraction has 35539 states and 117693 transitions. [2019-12-18 14:24:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:24:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35539 states and 117693 transitions. [2019-12-18 14:24:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:24:20,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:20,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:20,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-18 14:24:20,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:20,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078579880] [2019-12-18 14:24:20,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078579880] [2019-12-18 14:24:20,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:20,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:24:20,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811716872] [2019-12-18 14:24:20,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:24:20,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:24:20,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:24:20,161 INFO L87 Difference]: Start difference. First operand 35539 states and 117693 transitions. Second operand 4 states. [2019-12-18 14:24:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:20,239 INFO L93 Difference]: Finished difference Result 14114 states and 43412 transitions. [2019-12-18 14:24:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:24:20,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:24:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:20,265 INFO L225 Difference]: With dead ends: 14114 [2019-12-18 14:24:20,266 INFO L226 Difference]: Without dead ends: 14114 [2019-12-18 14:24:20,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:24:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-18 14:24:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 13924. [2019-12-18 14:24:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13924 states. [2019-12-18 14:24:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13924 states to 13924 states and 42859 transitions. [2019-12-18 14:24:20,471 INFO L78 Accepts]: Start accepts. Automaton has 13924 states and 42859 transitions. Word has length 25 [2019-12-18 14:24:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:20,472 INFO L462 AbstractCegarLoop]: Abstraction has 13924 states and 42859 transitions. [2019-12-18 14:24:20,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:24:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13924 states and 42859 transitions. [2019-12-18 14:24:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:24:20,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:20,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:20,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-18 14:24:20,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:20,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014815185] [2019-12-18 14:24:20,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:20,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014815185] [2019-12-18 14:24:20,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:20,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:24:20,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102168090] [2019-12-18 14:24:20,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:20,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:20,553 INFO L87 Difference]: Start difference. First operand 13924 states and 42859 transitions. Second operand 3 states. [2019-12-18 14:24:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:20,611 INFO L93 Difference]: Finished difference Result 13923 states and 42857 transitions. [2019-12-18 14:24:20,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:20,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:24:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:20,639 INFO L225 Difference]: With dead ends: 13923 [2019-12-18 14:24:20,639 INFO L226 Difference]: Without dead ends: 13923 [2019-12-18 14:24:20,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-12-18 14:24:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-12-18 14:24:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-12-18 14:24:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 42857 transitions. [2019-12-18 14:24:20,853 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 42857 transitions. Word has length 39 [2019-12-18 14:24:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:20,853 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 42857 transitions. [2019-12-18 14:24:20,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 42857 transitions. [2019-12-18 14:24:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:24:20,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:20,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:20,875 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-18 14:24:20,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:20,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159995232] [2019-12-18 14:24:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:20,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159995232] [2019-12-18 14:24:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:24:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303930428] [2019-12-18 14:24:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:24:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:24:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:20,942 INFO L87 Difference]: Start difference. First operand 13923 states and 42857 transitions. Second operand 5 states. [2019-12-18 14:24:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:21,034 INFO L93 Difference]: Finished difference Result 12630 states and 39534 transitions. [2019-12-18 14:24:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:24:21,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:24:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:21,065 INFO L225 Difference]: With dead ends: 12630 [2019-12-18 14:24:21,066 INFO L226 Difference]: Without dead ends: 12630 [2019-12-18 14:24:21,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12630 states. [2019-12-18 14:24:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12630 to 12176. [2019-12-18 14:24:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-18 14:24:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 38245 transitions. [2019-12-18 14:24:21,444 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 38245 transitions. Word has length 40 [2019-12-18 14:24:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 38245 transitions. [2019-12-18 14:24:21,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:24:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 38245 transitions. [2019-12-18 14:24:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:21,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:21,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:21,476 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-18 14:24:21,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965264475] [2019-12-18 14:24:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:21,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965264475] [2019-12-18 14:24:21,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:21,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:24:21,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382615714] [2019-12-18 14:24:21,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:21,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:21,583 INFO L87 Difference]: Start difference. First operand 12176 states and 38245 transitions. Second operand 3 states. [2019-12-18 14:24:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:21,693 INFO L93 Difference]: Finished difference Result 16224 states and 51098 transitions. [2019-12-18 14:24:21,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:21,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:24:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:21,719 INFO L225 Difference]: With dead ends: 16224 [2019-12-18 14:24:21,720 INFO L226 Difference]: Without dead ends: 16224 [2019-12-18 14:24:21,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16224 states. [2019-12-18 14:24:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16224 to 13560. [2019-12-18 14:24:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-12-18 14:24:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 43108 transitions. [2019-12-18 14:24:22,064 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 43108 transitions. Word has length 54 [2019-12-18 14:24:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:22,064 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 43108 transitions. [2019-12-18 14:24:22,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 43108 transitions. [2019-12-18 14:24:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:22,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:22,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:22,085 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-18 14:24:22,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:22,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925322740] [2019-12-18 14:24:22,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:22,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925322740] [2019-12-18 14:24:22,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:22,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:24:22,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152670045] [2019-12-18 14:24:22,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:24:22,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:24:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:24:22,169 INFO L87 Difference]: Start difference. First operand 13560 states and 43108 transitions. Second operand 4 states. [2019-12-18 14:24:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:22,263 INFO L93 Difference]: Finished difference Result 25313 states and 80847 transitions. [2019-12-18 14:24:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:24:22,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:24:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:22,284 INFO L225 Difference]: With dead ends: 25313 [2019-12-18 14:24:22,284 INFO L226 Difference]: Without dead ends: 12650 [2019-12-18 14:24:22,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12650 states. [2019-12-18 14:24:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12650 to 12650. [2019-12-18 14:24:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12650 states. [2019-12-18 14:24:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12650 states to 12650 states and 40344 transitions. [2019-12-18 14:24:22,476 INFO L78 Accepts]: Start accepts. Automaton has 12650 states and 40344 transitions. Word has length 54 [2019-12-18 14:24:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:22,476 INFO L462 AbstractCegarLoop]: Abstraction has 12650 states and 40344 transitions. [2019-12-18 14:24:22,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:24:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12650 states and 40344 transitions. [2019-12-18 14:24:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:22,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:22,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:22,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-18 14:24:22,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:22,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987007186] [2019-12-18 14:24:22,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:22,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987007186] [2019-12-18 14:24:22,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:22,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:24:22,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306059845] [2019-12-18 14:24:22,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:24:22,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:24:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:24:22,557 INFO L87 Difference]: Start difference. First operand 12650 states and 40344 transitions. Second operand 4 states. [2019-12-18 14:24:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:22,697 INFO L93 Difference]: Finished difference Result 30768 states and 100350 transitions. [2019-12-18 14:24:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:24:22,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:24:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:22,709 INFO L225 Difference]: With dead ends: 30768 [2019-12-18 14:24:22,709 INFO L226 Difference]: Without dead ends: 5072 [2019-12-18 14:24:22,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:24:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-18 14:24:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-18 14:24:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-18 14:24:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-18 14:24:22,856 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-18 14:24:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:22,857 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-18 14:24:22,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:24:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-18 14:24:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:22,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:22,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:22,866 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-18 14:24:22,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:22,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546766051] [2019-12-18 14:24:22,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:22,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546766051] [2019-12-18 14:24:22,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:24:22,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997049588] [2019-12-18 14:24:22,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:24:22,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:24:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:24:22,952 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-18 14:24:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:23,211 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-18 14:24:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:24:23,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:24:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:23,227 INFO L225 Difference]: With dead ends: 9562 [2019-12-18 14:24:23,227 INFO L226 Difference]: Without dead ends: 6984 [2019-12-18 14:24:23,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:24:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-18 14:24:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-18 14:24:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-18 14:24:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-18 14:24:23,346 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-18 14:24:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:23,346 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-18 14:24:23,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:24:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-18 14:24:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:23,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:23,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:23,354 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-18 14:24:23,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:23,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884747576] [2019-12-18 14:24:23,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:23,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884747576] [2019-12-18 14:24:23,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:23,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:24:23,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060200196] [2019-12-18 14:24:23,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:24:23,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:24:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:24:23,433 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-18 14:24:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:23,678 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-18 14:24:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:24:23,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:24:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:23,693 INFO L225 Difference]: With dead ends: 11586 [2019-12-18 14:24:23,694 INFO L226 Difference]: Without dead ends: 8529 [2019-12-18 14:24:23,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:24:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-18 14:24:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-18 14:24:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-18 14:24:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-18 14:24:23,826 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-18 14:24:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:23,827 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-18 14:24:23,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:24:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-18 14:24:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:23,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:23,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:23,837 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-18 14:24:23,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:23,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889152912] [2019-12-18 14:24:23,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:23,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889152912] [2019-12-18 14:24:23,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:23,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:24:23,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028538381] [2019-12-18 14:24:23,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:24:23,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:24:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:24:23,944 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-18 14:24:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:24,378 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-18 14:24:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:24:24,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:24:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:24,402 INFO L225 Difference]: With dead ends: 16599 [2019-12-18 14:24:24,402 INFO L226 Difference]: Without dead ends: 14168 [2019-12-18 14:24:24,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:24:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-18 14:24:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-18 14:24:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-18 14:24:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-18 14:24:24,571 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-18 14:24:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:24,571 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-18 14:24:24,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:24:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-18 14:24:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:24:24,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:24,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:24,584 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-18 14:24:24,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:24,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522315674] [2019-12-18 14:24:24,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:24,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522315674] [2019-12-18 14:24:24,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:24,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:24:24,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172142512] [2019-12-18 14:24:24,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:24,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:24,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:24,661 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-18 14:24:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:24,702 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-18 14:24:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:24,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:24:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:24,715 INFO L225 Difference]: With dead ends: 6206 [2019-12-18 14:24:24,716 INFO L226 Difference]: Without dead ends: 6206 [2019-12-18 14:24:24,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-18 14:24:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-18 14:24:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:24:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-18 14:24:24,840 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-18 14:24:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:24,840 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-18 14:24:24,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-18 14:24:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:24:24,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:24,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:24,850 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-18 14:24:24,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:24,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727964509] [2019-12-18 14:24:24,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:24,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727964509] [2019-12-18 14:24:24,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:24,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:24:24,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191778103] [2019-12-18 14:24:24,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:24,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:24,944 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-18 14:24:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:24,978 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-18 14:24:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:24,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:24:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:24,989 INFO L225 Difference]: With dead ends: 5926 [2019-12-18 14:24:24,989 INFO L226 Difference]: Without dead ends: 5926 [2019-12-18 14:24:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-18 14:24:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-18 14:24:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:24:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-18 14:24:25,083 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-18 14:24:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:25,083 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-18 14:24:25,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:24:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-18 14:24:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:25,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:25,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:25,091 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-18 14:24:25,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:25,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732214517] [2019-12-18 14:24:25,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:25,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732214517] [2019-12-18 14:24:25,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:25,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:24:25,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030619619] [2019-12-18 14:24:25,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:24:25,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:24:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:24:25,742 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 16 states. [2019-12-18 14:24:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:30,533 INFO L93 Difference]: Finished difference Result 12945 states and 39966 transitions. [2019-12-18 14:24:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:24:30,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 14:24:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:30,552 INFO L225 Difference]: With dead ends: 12945 [2019-12-18 14:24:30,552 INFO L226 Difference]: Without dead ends: 9935 [2019-12-18 14:24:30,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 14:24:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-12-18 14:24:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 7953. [2019-12-18 14:24:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2019-12-18 14:24:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 24854 transitions. [2019-12-18 14:24:30,684 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 24854 transitions. Word has length 56 [2019-12-18 14:24:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:30,684 INFO L462 AbstractCegarLoop]: Abstraction has 7953 states and 24854 transitions. [2019-12-18 14:24:30,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:24:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 24854 transitions. [2019-12-18 14:24:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:30,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:30,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:30,693 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 290005151, now seen corresponding path program 2 times [2019-12-18 14:24:30,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:30,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869725760] [2019-12-18 14:24:30,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:31,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869725760] [2019-12-18 14:24:31,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:31,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:24:31,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599068268] [2019-12-18 14:24:31,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:24:31,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:24:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:24:31,450 INFO L87 Difference]: Start difference. First operand 7953 states and 24854 transitions. Second operand 17 states. [2019-12-18 14:24:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:35,665 INFO L93 Difference]: Finished difference Result 10690 states and 33074 transitions. [2019-12-18 14:24:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:24:35,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 14:24:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:35,681 INFO L225 Difference]: With dead ends: 10690 [2019-12-18 14:24:35,681 INFO L226 Difference]: Without dead ends: 9232 [2019-12-18 14:24:35,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:24:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-12-18 14:24:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 7881. [2019-12-18 14:24:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7881 states. [2019-12-18 14:24:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 24662 transitions. [2019-12-18 14:24:35,807 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 24662 transitions. Word has length 56 [2019-12-18 14:24:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:35,807 INFO L462 AbstractCegarLoop]: Abstraction has 7881 states and 24662 transitions. [2019-12-18 14:24:35,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:24:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 24662 transitions. [2019-12-18 14:24:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:35,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:35,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:35,819 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1327897071, now seen corresponding path program 3 times [2019-12-18 14:24:35,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:35,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34462118] [2019-12-18 14:24:35,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:36,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34462118] [2019-12-18 14:24:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:36,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:24:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328997682] [2019-12-18 14:24:36,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:24:36,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:36,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:24:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:24:36,290 INFO L87 Difference]: Start difference. First operand 7881 states and 24662 transitions. Second operand 16 states. [2019-12-18 14:24:36,718 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-18 14:24:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:40,236 INFO L93 Difference]: Finished difference Result 14299 states and 44023 transitions. [2019-12-18 14:24:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:24:40,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 14:24:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:40,253 INFO L225 Difference]: With dead ends: 14299 [2019-12-18 14:24:40,253 INFO L226 Difference]: Without dead ends: 10473 [2019-12-18 14:24:40,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=378, Invalid=1974, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:24:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10473 states. [2019-12-18 14:24:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10473 to 8103. [2019-12-18 14:24:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-12-18 14:24:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 25116 transitions. [2019-12-18 14:24:40,398 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 25116 transitions. Word has length 56 [2019-12-18 14:24:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:40,398 INFO L462 AbstractCegarLoop]: Abstraction has 8103 states and 25116 transitions. [2019-12-18 14:24:40,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:24:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 25116 transitions. [2019-12-18 14:24:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:40,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:40,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:40,407 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash 736614263, now seen corresponding path program 4 times [2019-12-18 14:24:40,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:40,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061441242] [2019-12-18 14:24:40,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:40,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061441242] [2019-12-18 14:24:40,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:40,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:24:40,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253847593] [2019-12-18 14:24:40,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:24:40,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:24:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:24:40,967 INFO L87 Difference]: Start difference. First operand 8103 states and 25116 transitions. Second operand 17 states. [2019-12-18 14:24:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:44,348 INFO L93 Difference]: Finished difference Result 12737 states and 38696 transitions. [2019-12-18 14:24:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:24:44,348 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 14:24:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:44,365 INFO L225 Difference]: With dead ends: 12737 [2019-12-18 14:24:44,365 INFO L226 Difference]: Without dead ends: 10749 [2019-12-18 14:24:44,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 14:24:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2019-12-18 14:24:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 8195. [2019-12-18 14:24:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8195 states. [2019-12-18 14:24:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8195 states to 8195 states and 25348 transitions. [2019-12-18 14:24:44,628 INFO L78 Accepts]: Start accepts. Automaton has 8195 states and 25348 transitions. Word has length 56 [2019-12-18 14:24:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:44,628 INFO L462 AbstractCegarLoop]: Abstraction has 8195 states and 25348 transitions. [2019-12-18 14:24:44,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:24:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8195 states and 25348 transitions. [2019-12-18 14:24:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:44,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:44,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:44,637 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -518217893, now seen corresponding path program 5 times [2019-12-18 14:24:44,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318761687] [2019-12-18 14:24:44,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:45,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318761687] [2019-12-18 14:24:45,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:45,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:24:45,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230988267] [2019-12-18 14:24:45,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:24:45,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:24:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:24:45,298 INFO L87 Difference]: Start difference. First operand 8195 states and 25348 transitions. Second operand 16 states. [2019-12-18 14:24:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:48,373 INFO L93 Difference]: Finished difference Result 12815 states and 39182 transitions. [2019-12-18 14:24:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:24:48,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 14:24:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:48,393 INFO L225 Difference]: With dead ends: 12815 [2019-12-18 14:24:48,393 INFO L226 Difference]: Without dead ends: 10765 [2019-12-18 14:24:48,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:24:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10765 states. [2019-12-18 14:24:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10765 to 8427. [2019-12-18 14:24:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-12-18 14:24:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 26004 transitions. [2019-12-18 14:24:48,537 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 26004 transitions. Word has length 56 [2019-12-18 14:24:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:48,537 INFO L462 AbstractCegarLoop]: Abstraction has 8427 states and 26004 transitions. [2019-12-18 14:24:48,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:24:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 26004 transitions. [2019-12-18 14:24:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:48,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:48,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:48,546 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 6 times [2019-12-18 14:24:48,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:48,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763612315] [2019-12-18 14:24:48,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:49,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763612315] [2019-12-18 14:24:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:24:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663779697] [2019-12-18 14:24:49,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:24:49,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:24:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:24:49,215 INFO L87 Difference]: Start difference. First operand 8427 states and 26004 transitions. Second operand 19 states. [2019-12-18 14:24:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:54,517 INFO L93 Difference]: Finished difference Result 11889 states and 36097 transitions. [2019-12-18 14:24:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:24:54,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 14:24:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:54,534 INFO L225 Difference]: With dead ends: 11889 [2019-12-18 14:24:54,534 INFO L226 Difference]: Without dead ends: 10572 [2019-12-18 14:24:54,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=409, Invalid=2347, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:24:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2019-12-18 14:24:54,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 8445. [2019-12-18 14:24:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8445 states. [2019-12-18 14:24:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8445 states to 8445 states and 26063 transitions. [2019-12-18 14:24:54,668 INFO L78 Accepts]: Start accepts. Automaton has 8445 states and 26063 transitions. Word has length 56 [2019-12-18 14:24:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:54,668 INFO L462 AbstractCegarLoop]: Abstraction has 8445 states and 26063 transitions. [2019-12-18 14:24:54,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:24:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8445 states and 26063 transitions. [2019-12-18 14:24:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:54,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:54,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:54,678 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1532165987, now seen corresponding path program 7 times [2019-12-18 14:24:54,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:54,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363918625] [2019-12-18 14:24:54,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:54,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363918625] [2019-12-18 14:24:54,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:54,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:24:54,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679008629] [2019-12-18 14:24:54,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:24:54,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:24:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:24:54,903 INFO L87 Difference]: Start difference. First operand 8445 states and 26063 transitions. Second operand 12 states. [2019-12-18 14:24:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:56,950 INFO L93 Difference]: Finished difference Result 14296 states and 43704 transitions. [2019-12-18 14:24:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:24:56,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:24:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:56,968 INFO L225 Difference]: With dead ends: 14296 [2019-12-18 14:24:56,968 INFO L226 Difference]: Without dead ends: 11038 [2019-12-18 14:24:56,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:24:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11038 states. [2019-12-18 14:24:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11038 to 8782. [2019-12-18 14:24:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8782 states. [2019-12-18 14:24:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8782 states to 8782 states and 26952 transitions. [2019-12-18 14:24:57,113 INFO L78 Accepts]: Start accepts. Automaton has 8782 states and 26952 transitions. Word has length 56 [2019-12-18 14:24:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:57,113 INFO L462 AbstractCegarLoop]: Abstraction has 8782 states and 26952 transitions. [2019-12-18 14:24:57,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:24:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8782 states and 26952 transitions. [2019-12-18 14:24:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:57,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:57,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:57,123 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1460665759, now seen corresponding path program 8 times [2019-12-18 14:24:57,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:57,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538672106] [2019-12-18 14:24:57,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:57,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538672106] [2019-12-18 14:24:57,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:57,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:24:57,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339216092] [2019-12-18 14:24:57,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:24:57,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:24:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:24:57,362 INFO L87 Difference]: Start difference. First operand 8782 states and 26952 transitions. Second operand 13 states. [2019-12-18 14:24:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:59,161 INFO L93 Difference]: Finished difference Result 12426 states and 37638 transitions. [2019-12-18 14:24:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:24:59,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 14:24:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:59,176 INFO L225 Difference]: With dead ends: 12426 [2019-12-18 14:24:59,177 INFO L226 Difference]: Without dead ends: 11032 [2019-12-18 14:24:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:24:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11032 states. [2019-12-18 14:24:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11032 to 8616. [2019-12-18 14:24:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8616 states. [2019-12-18 14:24:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8616 states to 8616 states and 26520 transitions. [2019-12-18 14:24:59,304 INFO L78 Accepts]: Start accepts. Automaton has 8616 states and 26520 transitions. Word has length 56 [2019-12-18 14:24:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:24:59,304 INFO L462 AbstractCegarLoop]: Abstraction has 8616 states and 26520 transitions. [2019-12-18 14:24:59,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:24:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8616 states and 26520 transitions. [2019-12-18 14:24:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:24:59,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:59,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:24:59,313 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash -796419121, now seen corresponding path program 9 times [2019-12-18 14:24:59,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:59,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971318225] [2019-12-18 14:24:59,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:24:59,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971318225] [2019-12-18 14:24:59,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:59,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:24:59,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623599675] [2019-12-18 14:24:59,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:24:59,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:24:59,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:24:59,875 INFO L87 Difference]: Start difference. First operand 8616 states and 26520 transitions. Second operand 19 states. [2019-12-18 14:25:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:03,991 INFO L93 Difference]: Finished difference Result 11192 states and 33755 transitions. [2019-12-18 14:25:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:25:03,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 14:25:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:04,007 INFO L225 Difference]: With dead ends: 11192 [2019-12-18 14:25:04,007 INFO L226 Difference]: Without dead ends: 10730 [2019-12-18 14:25:04,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:25:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10730 states. [2019-12-18 14:25:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10730 to 8650. [2019-12-18 14:25:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-18 14:25:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 26624 transitions. [2019-12-18 14:25:04,146 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 26624 transitions. Word has length 56 [2019-12-18 14:25:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:04,147 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 26624 transitions. [2019-12-18 14:25:04,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:25:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 26624 transitions. [2019-12-18 14:25:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:04,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:04,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:04,156 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash -952960243, now seen corresponding path program 10 times [2019-12-18 14:25:04,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:04,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986620814] [2019-12-18 14:25:04,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:04,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986620814] [2019-12-18 14:25:04,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:04,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:25:04,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943077385] [2019-12-18 14:25:04,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:25:04,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:04,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:25:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:25:04,635 INFO L87 Difference]: Start difference. First operand 8650 states and 26624 transitions. Second operand 20 states. [2019-12-18 14:25:06,822 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-12-18 14:25:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:07,266 INFO L93 Difference]: Finished difference Result 10580 states and 31926 transitions. [2019-12-18 14:25:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 14:25:07,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 14:25:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:07,281 INFO L225 Difference]: With dead ends: 10580 [2019-12-18 14:25:07,282 INFO L226 Difference]: Without dead ends: 10184 [2019-12-18 14:25:07,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 14:25:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10184 states. [2019-12-18 14:25:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10184 to 8770. [2019-12-18 14:25:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8770 states. [2019-12-18 14:25:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 26957 transitions. [2019-12-18 14:25:07,420 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 26957 transitions. Word has length 56 [2019-12-18 14:25:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:07,421 INFO L462 AbstractCegarLoop]: Abstraction has 8770 states and 26957 transitions. [2019-12-18 14:25:07,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:25:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 26957 transitions. [2019-12-18 14:25:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:07,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:07,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:07,431 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1318202681, now seen corresponding path program 11 times [2019-12-18 14:25:07,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:07,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396234380] [2019-12-18 14:25:07,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:07,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396234380] [2019-12-18 14:25:07,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:07,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:25:07,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172799044] [2019-12-18 14:25:07,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:25:07,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:25:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:25:07,749 INFO L87 Difference]: Start difference. First operand 8770 states and 26957 transitions. Second operand 15 states. [2019-12-18 14:25:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:09,543 INFO L93 Difference]: Finished difference Result 12341 states and 37251 transitions. [2019-12-18 14:25:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:25:09,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 14:25:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:09,560 INFO L225 Difference]: With dead ends: 12341 [2019-12-18 14:25:09,560 INFO L226 Difference]: Without dead ends: 11053 [2019-12-18 14:25:09,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:25:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2019-12-18 14:25:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 8596. [2019-12-18 14:25:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2019-12-18 14:25:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 26468 transitions. [2019-12-18 14:25:09,706 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 26468 transitions. Word has length 56 [2019-12-18 14:25:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:09,706 INFO L462 AbstractCegarLoop]: Abstraction has 8596 states and 26468 transitions. [2019-12-18 14:25:09,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:25:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 26468 transitions. [2019-12-18 14:25:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:09,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:09,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:09,718 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -526249007, now seen corresponding path program 12 times [2019-12-18 14:25:09,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:09,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589844171] [2019-12-18 14:25:09,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:09,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589844171] [2019-12-18 14:25:09,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:09,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:25:09,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226190113] [2019-12-18 14:25:09,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:25:09,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:25:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:09,941 INFO L87 Difference]: Start difference. First operand 8596 states and 26468 transitions. Second operand 12 states. [2019-12-18 14:25:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:11,951 INFO L93 Difference]: Finished difference Result 14637 states and 44844 transitions. [2019-12-18 14:25:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:25:11,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:25:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:11,967 INFO L225 Difference]: With dead ends: 14637 [2019-12-18 14:25:11,968 INFO L226 Difference]: Without dead ends: 10757 [2019-12-18 14:25:11,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:25:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2019-12-18 14:25:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 8461. [2019-12-18 14:25:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-18 14:25:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 25953 transitions. [2019-12-18 14:25:12,110 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 25953 transitions. Word has length 56 [2019-12-18 14:25:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:12,110 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 25953 transitions. [2019-12-18 14:25:12,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:25:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 25953 transitions. [2019-12-18 14:25:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:12,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:12,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:12,121 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -454748779, now seen corresponding path program 13 times [2019-12-18 14:25:12,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:12,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606091281] [2019-12-18 14:25:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:12,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606091281] [2019-12-18 14:25:12,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:12,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:25:12,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990486599] [2019-12-18 14:25:12,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:25:12,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:25:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:25:12,383 INFO L87 Difference]: Start difference. First operand 8461 states and 25953 transitions. Second operand 13 states. [2019-12-18 14:25:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:14,690 INFO L93 Difference]: Finished difference Result 11827 states and 35843 transitions. [2019-12-18 14:25:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:25:14,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 14:25:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:14,706 INFO L225 Difference]: With dead ends: 11827 [2019-12-18 14:25:14,707 INFO L226 Difference]: Without dead ends: 10245 [2019-12-18 14:25:14,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:25:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10245 states. [2019-12-18 14:25:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10245 to 8093. [2019-12-18 14:25:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8093 states. [2019-12-18 14:25:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8093 states to 8093 states and 24917 transitions. [2019-12-18 14:25:14,844 INFO L78 Accepts]: Start accepts. Automaton has 8093 states and 24917 transitions. Word has length 56 [2019-12-18 14:25:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:14,844 INFO L462 AbstractCegarLoop]: Abstraction has 8093 states and 24917 transitions. [2019-12-18 14:25:14,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:25:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 8093 states and 24917 transitions. [2019-12-18 14:25:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:14,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:14,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:14,853 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 209497859, now seen corresponding path program 14 times [2019-12-18 14:25:14,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:14,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232874410] [2019-12-18 14:25:14,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:15,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232874410] [2019-12-18 14:25:15,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:15,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:25:15,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299911562] [2019-12-18 14:25:15,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:25:15,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:25:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:25:15,156 INFO L87 Difference]: Start difference. First operand 8093 states and 24917 transitions. Second operand 15 states. [2019-12-18 14:25:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:17,194 INFO L93 Difference]: Finished difference Result 11289 states and 34127 transitions. [2019-12-18 14:25:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:25:17,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 14:25:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:17,210 INFO L225 Difference]: With dead ends: 11289 [2019-12-18 14:25:17,210 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 14:25:17,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:25:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 14:25:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 7885. [2019-12-18 14:25:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7885 states. [2019-12-18 14:25:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7885 states to 7885 states and 24353 transitions. [2019-12-18 14:25:17,341 INFO L78 Accepts]: Start accepts. Automaton has 7885 states and 24353 transitions. Word has length 56 [2019-12-18 14:25:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:17,341 INFO L462 AbstractCegarLoop]: Abstraction has 7885 states and 24353 transitions. [2019-12-18 14:25:17,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:25:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7885 states and 24353 transitions. [2019-12-18 14:25:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:17,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:17,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:17,350 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1234081509, now seen corresponding path program 15 times [2019-12-18 14:25:17,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:17,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741730267] [2019-12-18 14:25:17,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:17,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741730267] [2019-12-18 14:25:17,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:17,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:25:17,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55355145] [2019-12-18 14:25:17,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:25:17,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:25:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:25:17,595 INFO L87 Difference]: Start difference. First operand 7885 states and 24353 transitions. Second operand 10 states. [2019-12-18 14:25:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:18,727 INFO L93 Difference]: Finished difference Result 10697 states and 32685 transitions. [2019-12-18 14:25:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:25:18,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 14:25:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:18,742 INFO L225 Difference]: With dead ends: 10697 [2019-12-18 14:25:18,742 INFO L226 Difference]: Without dead ends: 9083 [2019-12-18 14:25:18,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:25:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2019-12-18 14:25:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 7845. [2019-12-18 14:25:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7845 states. [2019-12-18 14:25:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7845 states to 7845 states and 24224 transitions. [2019-12-18 14:25:18,863 INFO L78 Accepts]: Start accepts. Automaton has 7845 states and 24224 transitions. Word has length 56 [2019-12-18 14:25:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:18,863 INFO L462 AbstractCegarLoop]: Abstraction has 7845 states and 24224 transitions. [2019-12-18 14:25:18,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:25:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7845 states and 24224 transitions. [2019-12-18 14:25:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:18,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:18,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:18,872 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 607872953, now seen corresponding path program 16 times [2019-12-18 14:25:18,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:18,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838759748] [2019-12-18 14:25:18,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:19,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838759748] [2019-12-18 14:25:19,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:19,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:19,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672925540] [2019-12-18 14:25:19,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:19,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:19,116 INFO L87 Difference]: Start difference. First operand 7845 states and 24224 transitions. Second operand 11 states. [2019-12-18 14:25:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:20,282 INFO L93 Difference]: Finished difference Result 10117 states and 30638 transitions. [2019-12-18 14:25:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:25:20,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:20,296 INFO L225 Difference]: With dead ends: 10117 [2019-12-18 14:25:20,296 INFO L226 Difference]: Without dead ends: 9299 [2019-12-18 14:25:20,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:25:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states. [2019-12-18 14:25:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7785. [2019-12-18 14:25:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7785 states. [2019-12-18 14:25:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 24072 transitions. [2019-12-18 14:25:20,524 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 24072 transitions. Word has length 56 [2019-12-18 14:25:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:20,524 INFO L462 AbstractCegarLoop]: Abstraction has 7785 states and 24072 transitions. [2019-12-18 14:25:20,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 24072 transitions. [2019-12-18 14:25:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:20,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:20,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:20,533 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 17 times [2019-12-18 14:25:20,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:20,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29422692] [2019-12-18 14:25:20,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:20,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:25:20,636 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:25:20,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39|) |v_ULTIMATE.start_main_~#t1828~0.offset_25| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_25|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1828~0.base_39|) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39|)) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_16|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:25:20,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-18 14:25:20,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 14:25:20,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:25:20,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1656492571 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1656492571 256) 0))) (or (and (= ~x~0_In1656492571 |P2Thread1of1ForFork1_#t~ite32_Out1656492571|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1656492571| ~x$w_buff1~0_In1656492571) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1656492571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1656492571, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1656492571, ~x~0=~x~0_In1656492571} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1656492571|, ~x$w_buff1~0=~x$w_buff1~0_In1656492571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1656492571, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1656492571, ~x~0=~x~0_In1656492571} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:25:20,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-936173586 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-936173586 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-936173586 |P1Thread1of1ForFork0_#t~ite28_Out-936173586|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-936173586|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-936173586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936173586} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-936173586, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-936173586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-936173586} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:25:20,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:25:20,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In951134029 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In951134029 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out951134029|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In951134029 |P2Thread1of1ForFork1_#t~ite34_Out951134029|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In951134029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In951134029} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out951134029|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In951134029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In951134029} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:25:20,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In973424429 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In973424429 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In973424429 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In973424429 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out973424429| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out973424429| ~x$w_buff1_used~0_In973424429) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In973424429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In973424429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In973424429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In973424429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In973424429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In973424429, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out973424429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:25:20,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-118279233 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-118279233 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-118279233)) (and (= ~x$r_buff0_thd2~0_In-118279233 ~x$r_buff0_thd2~0_Out-118279233) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-118279233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118279233} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-118279233|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-118279233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118279233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:25:20,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1088775334 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1088775334 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1088775334 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1088775334 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1088775334|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1088775334 |P1Thread1of1ForFork0_#t~ite31_Out-1088775334|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1088775334, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1088775334, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1088775334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1088775334|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1088775334, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1088775334, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1088775334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:25:20,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:25:20,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1774662816 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1774662816 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1774662816 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1774662816 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1774662816|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1774662816 |P2Thread1of1ForFork1_#t~ite35_Out1774662816|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1774662816, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1774662816, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1774662816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1774662816} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1774662816|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1774662816, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1774662816, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1774662816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1774662816} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:25:20,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1007847803 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1007847803 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1007847803| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1007847803| ~x$r_buff0_thd3~0_In-1007847803)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1007847803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1007847803} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1007847803|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1007847803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1007847803} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:25:20,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-177865761 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out-177865761| ~x$w_buff1~0_In-177865761) (= |P0Thread1of1ForFork2_#t~ite11_In-177865761| |P0Thread1of1ForFork2_#t~ite11_Out-177865761|)) (and (= ~x$w_buff1~0_In-177865761 |P0Thread1of1ForFork2_#t~ite11_Out-177865761|) (= |P0Thread1of1ForFork2_#t~ite12_Out-177865761| |P0Thread1of1ForFork2_#t~ite11_Out-177865761|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-177865761 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-177865761 256))) (= 0 (mod ~x$w_buff0_used~0_In-177865761 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-177865761 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-177865761, ~x$w_buff1~0=~x$w_buff1~0_In-177865761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177865761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-177865761, ~weak$$choice2~0=~weak$$choice2~0_In-177865761, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-177865761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177865761} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-177865761, ~x$w_buff1~0=~x$w_buff1~0_In-177865761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177865761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-177865761, ~weak$$choice2~0=~weak$$choice2~0_In-177865761, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-177865761|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-177865761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177865761} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:25:20,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1714988571 256) 0))) (or (and (= ~x$w_buff0_used~0_In1714988571 |P0Thread1of1ForFork2_#t~ite14_Out1714988571|) (= |P0Thread1of1ForFork2_#t~ite15_Out1714988571| |P0Thread1of1ForFork2_#t~ite14_Out1714988571|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1714988571 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1714988571 256))) (= (mod ~x$w_buff0_used~0_In1714988571 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1714988571 256)) .cse1)))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1714988571| ~x$w_buff0_used~0_In1714988571) (= |P0Thread1of1ForFork2_#t~ite14_In1714988571| |P0Thread1of1ForFork2_#t~ite14_Out1714988571|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1714988571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1714988571, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1714988571|, ~weak$$choice2~0=~weak$$choice2~0_In1714988571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1714988571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1714988571|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1714988571, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1714988571|, ~weak$$choice2~0=~weak$$choice2~0_In1714988571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:25:20,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:25:20,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-552256721 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-552256721| ~x$r_buff1_thd1~0_In-552256721) (= |P0Thread1of1ForFork2_#t~ite23_In-552256721| |P0Thread1of1ForFork2_#t~ite23_Out-552256721|) (not .cse0)) (and .cse0 (= ~x$r_buff1_thd1~0_In-552256721 |P0Thread1of1ForFork2_#t~ite23_Out-552256721|) (= |P0Thread1of1ForFork2_#t~ite24_Out-552256721| |P0Thread1of1ForFork2_#t~ite23_Out-552256721|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-552256721 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-552256721 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-552256721 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-552256721 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-552256721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552256721, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-552256721, ~weak$$choice2~0=~weak$$choice2~0_In-552256721, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-552256721|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-552256721} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-552256721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552256721, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-552256721, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-552256721|, ~weak$$choice2~0=~weak$$choice2~0_In-552256721, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-552256721|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-552256721} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:25:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:25:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1174968529 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1174968529 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1174968529 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1174968529 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1174968529| ~x$r_buff1_thd3~0_In1174968529) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1174968529|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1174968529, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1174968529|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1174968529, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:25:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:25:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:25:20,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In107474161 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out107474161| |ULTIMATE.start_main_#t~ite41_Out107474161|)) (.cse2 (= (mod ~x$w_buff1_used~0_In107474161 256) 0))) (or (and (= ~x~0_In107474161 |ULTIMATE.start_main_#t~ite41_Out107474161|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out107474161| ~x$w_buff1~0_In107474161)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In107474161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In107474161, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In107474161, ~x~0=~x~0_In107474161} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out107474161|, ~x$w_buff1~0=~x$w_buff1~0_In107474161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In107474161, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In107474161, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out107474161|, ~x~0=~x~0_In107474161} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:25:20,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-186276122 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-186276122 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-186276122| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-186276122| ~x$w_buff0_used~0_In-186276122)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-186276122, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-186276122|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:25:20,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1518241095 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1518241095 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1518241095 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1518241095 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1518241095| 0)) (and (= ~x$w_buff1_used~0_In1518241095 |ULTIMATE.start_main_#t~ite44_Out1518241095|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1518241095, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1518241095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518241095} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1518241095, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1518241095, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1518241095|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518241095} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:25:20,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1666445025 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1666445025 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1666445025| ~x$r_buff0_thd0~0_In1666445025)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1666445025| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1666445025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666445025} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1666445025, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1666445025|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666445025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:25:20,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1700900858 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1700900858 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1700900858 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1700900858 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1700900858|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite46_Out-1700900858| ~x$r_buff1_thd0~0_In-1700900858) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1700900858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1700900858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1700900858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1700900858} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1700900858, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1700900858|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1700900858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1700900858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1700900858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:25:20,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:25:20,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:25:20 BasicIcfg [2019-12-18 14:25:20,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:25:20,732 INFO L168 Benchmark]: Toolchain (without parser) took 101126.65 ms. Allocated memory was 142.6 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 98.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 765.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,732 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.36 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 98.2 MB in the beginning and 154.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.49 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,733 INFO L168 Benchmark]: Boogie Preprocessor took 42.90 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,734 INFO L168 Benchmark]: RCFGBuilder took 832.29 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 102.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,734 INFO L168 Benchmark]: TraceAbstraction took 99357.18 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 710.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:20,738 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.36 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 98.2 MB in the beginning and 154.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.49 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.90 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.29 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 102.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99357.18 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 710.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.0s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 54.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6427 SDtfs, 10604 SDslu, 30451 SDs, 0 SdLazy, 40002 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 30 SyntacticMatches, 30 SemanticMatches, 632 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4905 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 94516 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1578 NumberOfCodeBlocks, 1578 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 512768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 proved your program to be incorrect! Received shutdown request...