/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/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:41:58,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:41:58,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:41:58,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:41:58,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:41:58,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:41:58,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:41:58,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:41:58,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:41:58,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:41:58,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:41:58,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:41:58,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:41:58,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:41:58,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:41:58,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:41:58,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:41:58,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:41:58,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:41:58,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:41:58,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:41:58,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:41:58,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:41:58,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:41:58,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:41:58,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:41:58,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:41:58,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:41:58,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:41:58,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:41:58,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:41:58,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:41:58,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:41:58,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:41:58,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:41:58,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:41:58,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:41:58,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:41:58,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:41:58,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:41:58,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:41:58,404 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-26 23:41:58,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:41:58,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:41:58,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:41:58,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:41:58,433 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:41:58,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:41:58,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:41:58,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:41:58,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:41:58,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:41:58,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:41:58,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:41:58,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:41:58,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:41:58,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:41:58,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:41:58,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:58,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:41:58,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:41:58,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:41:58,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:41:58,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:41:58,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:41:58,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:41:58,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:41:58,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:41:58,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:41:58,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:41:58,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:41:58,731 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:41:58,732 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-26 23:41:58,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bba5fcb9/644b360d5e344f948e922647f1e19394/FLAGf1285a254 [2019-12-26 23:41:59,369 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:41:59,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-26 23:41:59,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bba5fcb9/644b360d5e344f948e922647f1e19394/FLAGf1285a254 [2019-12-26 23:41:59,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bba5fcb9/644b360d5e344f948e922647f1e19394 [2019-12-26 23:41:59,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:41:59,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:41:59,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:59,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:41:59,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:41:59,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:59" (1/1) ... [2019-12-26 23:41:59,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b64cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:59, skipping insertion in model container [2019-12-26 23:41:59,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:59" (1/1) ... [2019-12-26 23:41:59,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:41:59,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:42:00,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:42:00,263 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:42:00,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:42:00,405 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:42:00,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00 WrapperNode [2019-12-26 23:42:00,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:42:00,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:42:00,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:42:00,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:42:00,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:42:00,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:42:00,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:42:00,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:42:00,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (1/1) ... [2019-12-26 23:42:00,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:42:00,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:42:00,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:42:00,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:42:00,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (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-26 23:42:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:42:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:42:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:42:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:42:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:42:00,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:42:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:42:00,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:42:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:42:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:42:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:42:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:42:00,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:42:00,610 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:42:01,329 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:42:01,330 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:42:01,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:42:01 BoogieIcfgContainer [2019-12-26 23:42:01,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:42:01,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:42:01,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:42:01,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:42:01,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:41:59" (1/3) ... [2019-12-26 23:42:01,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18022af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:42:01, skipping insertion in model container [2019-12-26 23:42:01,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:00" (2/3) ... [2019-12-26 23:42:01,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18022af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:42:01, skipping insertion in model container [2019-12-26 23:42:01,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:42:01" (3/3) ... [2019-12-26 23:42:01,342 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2019-12-26 23:42:01,352 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:42:01,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:42:01,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:42:01,367 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:42:01,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,427 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,427 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,466 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,466 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:01,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:42:01,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:42:01,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:42:01,504 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:42:01,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:42:01,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:42:01,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:42:01,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:42:01,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:42:01,522 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:42:01,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:42:01,627 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:42:01,628 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:42:01,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:42:01,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:42:01,722 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:42:01,722 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:42:01,731 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:42:01,750 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:42:01,751 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:42:06,613 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:42:06,719 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:42:06,748 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-26 23:42:06,748 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:42:06,752 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-26 23:42:21,988 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-26 23:42:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-26 23:42:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:42:21,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:21,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:42:21,996 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:22,001 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-26 23:42:22,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:22,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482402362] [2019-12-26 23:42:22,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:22,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-26 23:42:22,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482402362] [2019-12-26 23:42:22,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:22,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:42:22,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137736451] [2019-12-26 23:42:22,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:22,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:22,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:22,254 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-26 23:42:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:26,013 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-26 23:42:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:26,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:42:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:26,910 INFO L225 Difference]: With dead ends: 104560 [2019-12-26 23:42:26,910 INFO L226 Difference]: Without dead ends: 102376 [2019-12-26 23:42:26,912 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-26 23:42:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-26 23:42:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-26 23:42:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-26 23:42:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-26 23:42:37,125 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-26 23:42:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:37,125 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-26 23:42:37,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-26 23:42:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:42:37,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:37,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:37,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-26 23:42:37,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:37,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307059255] [2019-12-26 23:42:37,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:37,228 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-26 23:42:37,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307059255] [2019-12-26 23:42:37,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:37,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:37,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274489435] [2019-12-26 23:42:37,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:37,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:37,232 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-26 23:42:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:42,268 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-26 23:42:42,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:42,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:42:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:42,822 INFO L225 Difference]: With dead ends: 164490 [2019-12-26 23:42:42,822 INFO L226 Difference]: Without dead ends: 164441 [2019-12-26 23:42:42,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-26 23:42:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-26 23:42:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-26 23:42:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-26 23:42:51,055 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-26 23:42:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:51,056 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-26 23:42:51,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-26 23:42:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:51,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:51,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:51,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-26 23:42:51,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:51,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633693221] [2019-12-26 23:42:51,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:51,187 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-26 23:42:51,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633693221] [2019-12-26 23:42:51,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:51,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:51,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583587886] [2019-12-26 23:42:51,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:51,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:51,189 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-26 23:42:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:57,671 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-26 23:42:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:57,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:42:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:58,430 INFO L225 Difference]: With dead ends: 211896 [2019-12-26 23:42:58,430 INFO L226 Difference]: Without dead ends: 211833 [2019-12-26 23:42:58,431 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-26 23:43:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-26 23:43:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-26 23:43:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-26 23:43:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-26 23:43:16,517 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-26 23:43:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:16,518 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-26 23:43:16,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-26 23:43:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:16,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:16,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:16,522 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-26 23:43:16,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:16,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620639487] [2019-12-26 23:43:16,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:16,564 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-26 23:43:16,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620639487] [2019-12-26 23:43:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285135586] [2019-12-26 23:43:16,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:16,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:16,567 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-26 23:43:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:16,700 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-26 23:43:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:16,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:43:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:16,777 INFO L225 Difference]: With dead ends: 36088 [2019-12-26 23:43:16,777 INFO L226 Difference]: Without dead ends: 36088 [2019-12-26 23:43:16,778 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-26 23:43:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-26 23:43:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-26 23:43:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-26 23:43:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-26 23:43:17,609 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-26 23:43:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:17,609 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-26 23:43:17,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-26 23:43:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:43:17,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:17,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:17,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-26 23:43:17,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:17,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774146464] [2019-12-26 23:43:17,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:17,714 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-26 23:43:17,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774146464] [2019-12-26 23:43:17,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:17,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:43:17,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210625329] [2019-12-26 23:43:17,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:43:17,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:43:17,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:17,716 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-26 23:43:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:18,451 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-26 23:43:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:43:18,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:43:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:19,996 INFO L225 Difference]: With dead ends: 49088 [2019-12-26 23:43:19,996 INFO L226 Difference]: Without dead ends: 49075 [2019-12-26 23:43:19,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:43:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-26 23:43:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-26 23:43:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-26 23:43:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-26 23:43:20,718 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-26 23:43:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:20,718 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-26 23:43:20,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:43:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-26 23:43:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:43:20,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:20,732 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-26 23:43:20,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-26 23:43:20,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:20,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019105391] [2019-12-26 23:43:20,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:20,792 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-26 23:43:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019105391] [2019-12-26 23:43:20,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:20,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:43:20,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019296433] [2019-12-26 23:43:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:20,794 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-26 23:43:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:20,836 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-26 23:43:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:43:20,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:43:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:20,847 INFO L225 Difference]: With dead ends: 7050 [2019-12-26 23:43:20,848 INFO L226 Difference]: Without dead ends: 7050 [2019-12-26 23:43:20,848 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-26 23:43:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-26 23:43:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-26 23:43:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-26 23:43:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-26 23:43:20,988 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-26 23:43:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:20,989 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-26 23:43:20,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-26 23:43:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:43:21,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:21,002 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] [2019-12-26 23:43:21,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-26 23:43:21,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:21,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751485516] [2019-12-26 23:43:21,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:21,122 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-26 23:43:21,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751485516] [2019-12-26 23:43:21,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:21,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:43:21,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296547654] [2019-12-26 23:43:21,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:43:21,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:43:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:21,124 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-26 23:43:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:21,164 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-26 23:43:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:21,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:43:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:21,173 INFO L225 Difference]: With dead ends: 5023 [2019-12-26 23:43:21,173 INFO L226 Difference]: Without dead ends: 5023 [2019-12-26 23:43:21,174 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-26 23:43:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-26 23:43:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-26 23:43:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-26 23:43:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-26 23:43:21,264 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-26 23:43:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:21,264 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-26 23:43:21,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:43:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-26 23:43:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:21,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:21,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:21,275 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-26 23:43:21,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:21,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110764039] [2019-12-26 23:43:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:21,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110764039] [2019-12-26 23:43:21,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:21,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:43:21,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861988068] [2019-12-26 23:43:21,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:21,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:21,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:21,350 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:43:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:21,410 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-26 23:43:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:21,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:43:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:21,418 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:43:21,418 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:43:21,419 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-26 23:43:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:43:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:43:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:43:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-26 23:43:21,481 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-26 23:43:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:21,482 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-26 23:43:21,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-26 23:43:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:21,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:21,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:21,489 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-26 23:43:21,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:21,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430310205] [2019-12-26 23:43:21,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:21,563 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-26 23:43:21,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430310205] [2019-12-26 23:43:21,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:21,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:43:21,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969404319] [2019-12-26 23:43:21,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:21,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:21,570 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-26 23:43:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:21,632 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-26 23:43:21,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:21,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:43:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:21,642 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:43:21,642 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:43:21,643 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-26 23:43:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:43:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:43:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:43:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-26 23:43:21,732 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-26 23:43:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:21,732 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-26 23:43:21,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-26 23:43:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:21,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:21,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:21,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-26 23:43:21,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:21,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902728846] [2019-12-26 23:43:21,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:21,856 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-26 23:43:21,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902728846] [2019-12-26 23:43:21,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:21,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:43:21,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938014315] [2019-12-26 23:43:21,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:43:21,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:43:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:21,859 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-26 23:43:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:22,949 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-26 23:43:22,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:43:22,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:43:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:22,957 INFO L225 Difference]: With dead ends: 7088 [2019-12-26 23:43:22,958 INFO L226 Difference]: Without dead ends: 7088 [2019-12-26 23:43:22,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:43:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-26 23:43:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-26 23:43:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-26 23:43:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-26 23:43:23,041 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-26 23:43:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:23,041 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-26 23:43:23,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:43:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-26 23:43:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:23,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:23,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:23,050 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-26 23:43:23,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:23,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616462741] [2019-12-26 23:43:23,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:23,162 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-26 23:43:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616462741] [2019-12-26 23:43:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:23,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:43:23,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722461834] [2019-12-26 23:43:23,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:43:23,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:43:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:23,164 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-26 23:43:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:23,524 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-26 23:43:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:43:23,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:43:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:23,537 INFO L225 Difference]: With dead ends: 9067 [2019-12-26 23:43:23,537 INFO L226 Difference]: Without dead ends: 9067 [2019-12-26 23:43:23,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:43:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-26 23:43:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-26 23:43:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-26 23:43:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-26 23:43:23,646 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-26 23:43:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:23,647 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-26 23:43:23,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:43:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-26 23:43:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:23,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:23,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:23,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-26 23:43:23,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:23,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974184499] [2019-12-26 23:43:23,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:23,743 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-26 23:43:23,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974184499] [2019-12-26 23:43:23,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:23,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:43:23,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690241920] [2019-12-26 23:43:23,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:43:23,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:43:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:43:23,746 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-26 23:43:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:24,298 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-26 23:43:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:43:24,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:43:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:24,315 INFO L225 Difference]: With dead ends: 10883 [2019-12-26 23:43:24,315 INFO L226 Difference]: Without dead ends: 10883 [2019-12-26 23:43:24,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:43:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-26 23:43:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-26 23:43:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-26 23:43:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-26 23:43:24,468 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-26 23:43:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:24,468 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-26 23:43:24,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:43:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-26 23:43:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:24,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:24,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:24,478 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-26 23:43:24,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:24,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614420306] [2019-12-26 23:43:24,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:24,611 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-26 23:43:24,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614420306] [2019-12-26 23:43:24,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:24,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:43:24,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056336152] [2019-12-26 23:43:24,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:43:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:24,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:43:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:43:24,613 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 7 states. [2019-12-26 23:43:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:25,552 INFO L93 Difference]: Finished difference Result 11106 states and 31910 transitions. [2019-12-26 23:43:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:43:25,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:43:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:25,567 INFO L225 Difference]: With dead ends: 11106 [2019-12-26 23:43:25,567 INFO L226 Difference]: Without dead ends: 11106 [2019-12-26 23:43:25,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:43:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2019-12-26 23:43:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 6997. [2019-12-26 23:43:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6997 states. [2019-12-26 23:43:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 20313 transitions. [2019-12-26 23:43:25,695 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 20313 transitions. Word has length 65 [2019-12-26 23:43:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:25,696 INFO L462 AbstractCegarLoop]: Abstraction has 6997 states and 20313 transitions. [2019-12-26 23:43:25,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:43:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 20313 transitions. [2019-12-26 23:43:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:25,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:25,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:25,706 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash 695487673, now seen corresponding path program 5 times [2019-12-26 23:43:25,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:25,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555016875] [2019-12-26 23:43:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:25,853 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-26 23:43:25,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555016875] [2019-12-26 23:43:25,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:25,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:43:25,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885172169] [2019-12-26 23:43:25,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:43:25,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:25,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:43:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:43:25,855 INFO L87 Difference]: Start difference. First operand 6997 states and 20313 transitions. Second operand 7 states. [2019-12-26 23:43:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:25,983 INFO L93 Difference]: Finished difference Result 14297 states and 41924 transitions. [2019-12-26 23:43:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:43:25,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:43:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:25,997 INFO L225 Difference]: With dead ends: 14297 [2019-12-26 23:43:25,998 INFO L226 Difference]: Without dead ends: 8841 [2019-12-26 23:43:25,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:43:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2019-12-26 23:43:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 6579. [2019-12-26 23:43:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-26 23:43:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 19079 transitions. [2019-12-26 23:43:26,174 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 19079 transitions. Word has length 65 [2019-12-26 23:43:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:26,174 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 19079 transitions. [2019-12-26 23:43:26,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:43:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 19079 transitions. [2019-12-26 23:43:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:26,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:26,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:26,189 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1304907827, now seen corresponding path program 6 times [2019-12-26 23:43:26,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:26,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004708836] [2019-12-26 23:43:26,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:26,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-26 23:43:26,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004708836] [2019-12-26 23:43:26,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:26,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:43:26,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966507580] [2019-12-26 23:43:26,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:43:26,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:43:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:43:26,290 INFO L87 Difference]: Start difference. First operand 6579 states and 19079 transitions. Second operand 6 states. [2019-12-26 23:43:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:28,184 INFO L93 Difference]: Finished difference Result 9537 states and 27106 transitions. [2019-12-26 23:43:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:43:28,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:43:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:28,196 INFO L225 Difference]: With dead ends: 9537 [2019-12-26 23:43:28,197 INFO L226 Difference]: Without dead ends: 9537 [2019-12-26 23:43:28,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:43:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-26 23:43:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 6860. [2019-12-26 23:43:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-12-26 23:43:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 19878 transitions. [2019-12-26 23:43:28,305 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 19878 transitions. Word has length 65 [2019-12-26 23:43:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:28,305 INFO L462 AbstractCegarLoop]: Abstraction has 6860 states and 19878 transitions. [2019-12-26 23:43:28,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:43:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 19878 transitions. [2019-12-26 23:43:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:28,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:28,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:28,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -338304105, now seen corresponding path program 7 times [2019-12-26 23:43:28,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:28,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740286227] [2019-12-26 23:43:28,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:28,472 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-26 23:43:28,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740286227] [2019-12-26 23:43:28,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:28,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:43:28,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159043440] [2019-12-26 23:43:28,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:43:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:43:28,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:43:28,474 INFO L87 Difference]: Start difference. First operand 6860 states and 19878 transitions. Second operand 9 states. [2019-12-26 23:43:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:29,574 INFO L93 Difference]: Finished difference Result 10605 states and 30155 transitions. [2019-12-26 23:43:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:43:29,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 23:43:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:29,589 INFO L225 Difference]: With dead ends: 10605 [2019-12-26 23:43:29,589 INFO L226 Difference]: Without dead ends: 10605 [2019-12-26 23:43:29,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:43:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2019-12-26 23:43:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7315. [2019-12-26 23:43:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-12-26 23:43:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 21208 transitions. [2019-12-26 23:43:29,723 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 21208 transitions. Word has length 65 [2019-12-26 23:43:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:29,723 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 21208 transitions. [2019-12-26 23:43:29,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:43:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 21208 transitions. [2019-12-26 23:43:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:29,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:29,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:29,731 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:29,732 INFO L82 PathProgramCache]: Analyzing trace with hash 882387211, now seen corresponding path program 8 times [2019-12-26 23:43:29,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:29,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412013467] [2019-12-26 23:43:29,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:29,839 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-26 23:43:29,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412013467] [2019-12-26 23:43:29,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:29,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:43:29,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776632377] [2019-12-26 23:43:29,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:43:29,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:43:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:43:29,843 INFO L87 Difference]: Start difference. First operand 7315 states and 21208 transitions. Second operand 7 states. [2019-12-26 23:43:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:30,663 INFO L93 Difference]: Finished difference Result 11968 states and 34206 transitions. [2019-12-26 23:43:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:43:30,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:43:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:30,679 INFO L225 Difference]: With dead ends: 11968 [2019-12-26 23:43:30,679 INFO L226 Difference]: Without dead ends: 11968 [2019-12-26 23:43:30,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:43:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11968 states. [2019-12-26 23:43:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11968 to 6995. [2019-12-26 23:43:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-12-26 23:43:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 20314 transitions. [2019-12-26 23:43:30,801 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 20314 transitions. Word has length 65 [2019-12-26 23:43:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:30,801 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 20314 transitions. [2019-12-26 23:43:30,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:43:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 20314 transitions. [2019-12-26 23:43:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:30,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:30,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:30,808 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -466619985, now seen corresponding path program 9 times [2019-12-26 23:43:30,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:30,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876895433] [2019-12-26 23:43:30,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:30,919 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-26 23:43:30,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876895433] [2019-12-26 23:43:30,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:30,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:43:30,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800566463] [2019-12-26 23:43:30,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:43:30,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:43:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:43:30,921 INFO L87 Difference]: Start difference. First operand 6995 states and 20314 transitions. Second operand 8 states. [2019-12-26 23:43:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:32,043 INFO L93 Difference]: Finished difference Result 11870 states and 33943 transitions. [2019-12-26 23:43:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:43:32,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 23:43:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:32,061 INFO L225 Difference]: With dead ends: 11870 [2019-12-26 23:43:32,061 INFO L226 Difference]: Without dead ends: 11870 [2019-12-26 23:43:32,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:43:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2019-12-26 23:43:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6757. [2019-12-26 23:43:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-12-26 23:43:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 19602 transitions. [2019-12-26 23:43:32,402 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 19602 transitions. Word has length 65 [2019-12-26 23:43:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:32,403 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 19602 transitions. [2019-12-26 23:43:32,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:43:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 19602 transitions. [2019-12-26 23:43:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:32,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:32,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:32,417 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 794564457, now seen corresponding path program 10 times [2019-12-26 23:43:32,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:32,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733470563] [2019-12-26 23:43:32,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:32,546 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-26 23:43:32,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733470563] [2019-12-26 23:43:32,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:32,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:43:32,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486971002] [2019-12-26 23:43:32,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:43:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:43:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:43:32,549 INFO L87 Difference]: Start difference. First operand 6757 states and 19602 transitions. Second operand 7 states. [2019-12-26 23:43:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:33,156 INFO L93 Difference]: Finished difference Result 11247 states and 32123 transitions. [2019-12-26 23:43:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:43:33,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:43:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:33,172 INFO L225 Difference]: With dead ends: 11247 [2019-12-26 23:43:33,172 INFO L226 Difference]: Without dead ends: 11247 [2019-12-26 23:43:33,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:43:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11247 states. [2019-12-26 23:43:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11247 to 6841. [2019-12-26 23:43:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-12-26 23:43:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 19803 transitions. [2019-12-26 23:43:33,293 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 19803 transitions. Word has length 65 [2019-12-26 23:43:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:33,293 INFO L462 AbstractCegarLoop]: Abstraction has 6841 states and 19803 transitions. [2019-12-26 23:43:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:43:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 19803 transitions. [2019-12-26 23:43:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:43:33,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:33,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:33,301 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1278916147, now seen corresponding path program 11 times [2019-12-26 23:43:33,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:33,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341018011] [2019-12-26 23:43:33,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:33,408 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-26 23:43:33,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341018011] [2019-12-26 23:43:33,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:33,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:43:33,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204274302] [2019-12-26 23:43:33,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:43:33,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:33,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:43:33,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:43:33,410 INFO L87 Difference]: Start difference. First operand 6841 states and 19803 transitions. Second operand 8 states. [2019-12-26 23:43:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:34,509 INFO L93 Difference]: Finished difference Result 11902 states and 33986 transitions. [2019-12-26 23:43:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:43:34,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 23:43:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:34,525 INFO L225 Difference]: With dead ends: 11902 [2019-12-26 23:43:34,525 INFO L226 Difference]: Without dead ends: 11902 [2019-12-26 23:43:34,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:43:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-12-26 23:43:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6141. [2019-12-26 23:43:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2019-12-26 23:43:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 17820 transitions. [2019-12-26 23:43:34,635 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 17820 transitions. Word has length 65 [2019-12-26 23:43:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:34,635 INFO L462 AbstractCegarLoop]: Abstraction has 6141 states and 17820 transitions. [2019-12-26 23:43:34,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:43:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 17820 transitions. [2019-12-26 23:43:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:43:34,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:34,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:43:34,642 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 662541241, now seen corresponding path program 1 times [2019-12-26 23:43:34,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:34,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309231274] [2019-12-26 23:43:34,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:34,700 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-26 23:43:34,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309231274] [2019-12-26 23:43:34,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:34,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:34,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133567668] [2019-12-26 23:43:34,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:34,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:34,702 INFO L87 Difference]: Start difference. First operand 6141 states and 17820 transitions. Second operand 3 states. [2019-12-26 23:43:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:34,730 INFO L93 Difference]: Finished difference Result 5777 states and 16412 transitions. [2019-12-26 23:43:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:34,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:43:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:34,738 INFO L225 Difference]: With dead ends: 5777 [2019-12-26 23:43:34,738 INFO L226 Difference]: Without dead ends: 5777 [2019-12-26 23:43:34,739 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-26 23:43:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-26 23:43:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 5777. [2019-12-26 23:43:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5777 states. [2019-12-26 23:43:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 16412 transitions. [2019-12-26 23:43:34,836 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 16412 transitions. Word has length 66 [2019-12-26 23:43:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:34,837 INFO L462 AbstractCegarLoop]: Abstraction has 5777 states and 16412 transitions. [2019-12-26 23:43:34,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 16412 transitions. [2019-12-26 23:43:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:43:34,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:34,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:34,845 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1278364733, now seen corresponding path program 1 times [2019-12-26 23:43:34,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:34,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969796977] [2019-12-26 23:43:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:34,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969796977] [2019-12-26 23:43:34,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:34,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:34,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464435234] [2019-12-26 23:43:34,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:34,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:34,897 INFO L87 Difference]: Start difference. First operand 5777 states and 16412 transitions. Second operand 3 states. [2019-12-26 23:43:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:34,956 INFO L93 Difference]: Finished difference Result 5777 states and 16411 transitions. [2019-12-26 23:43:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:34,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:43:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:34,964 INFO L225 Difference]: With dead ends: 5777 [2019-12-26 23:43:34,964 INFO L226 Difference]: Without dead ends: 5777 [2019-12-26 23:43:34,965 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-26 23:43:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-26 23:43:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 3708. [2019-12-26 23:43:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3708 states. [2019-12-26 23:43:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 10669 transitions. [2019-12-26 23:43:35,029 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 10669 transitions. Word has length 66 [2019-12-26 23:43:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:35,030 INFO L462 AbstractCegarLoop]: Abstraction has 3708 states and 10669 transitions. [2019-12-26 23:43:35,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 10669 transitions. [2019-12-26 23:43:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:43:35,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:35,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:35,035 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 897051641, now seen corresponding path program 1 times [2019-12-26 23:43:35,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:35,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004877195] [2019-12-26 23:43:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:35,084 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-26 23:43:35,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004877195] [2019-12-26 23:43:35,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:35,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:35,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833934385] [2019-12-26 23:43:35,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:35,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:35,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:35,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:35,086 INFO L87 Difference]: Start difference. First operand 3708 states and 10669 transitions. Second operand 3 states. [2019-12-26 23:43:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:35,108 INFO L93 Difference]: Finished difference Result 3508 states and 9871 transitions. [2019-12-26 23:43:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:35,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:43:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:35,113 INFO L225 Difference]: With dead ends: 3508 [2019-12-26 23:43:35,113 INFO L226 Difference]: Without dead ends: 3508 [2019-12-26 23:43:35,114 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-26 23:43:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-12-26 23:43:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2815. [2019-12-26 23:43:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-26 23:43:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-26 23:43:35,173 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 67 [2019-12-26 23:43:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:35,173 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-26 23:43:35,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-26 23:43:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:35,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:35,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:35,177 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-26 23:43:35,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:35,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766618199] [2019-12-26 23:43:35,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:35,601 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-26 23:43:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766618199] [2019-12-26 23:43:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:43:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305224714] [2019-12-26 23:43:35,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:43:35,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:43:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:43:35,607 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 16 states. [2019-12-26 23:43:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:36,917 INFO L93 Difference]: Finished difference Result 5866 states and 16387 transitions. [2019-12-26 23:43:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:43:36,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-26 23:43:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:36,925 INFO L225 Difference]: With dead ends: 5866 [2019-12-26 23:43:36,925 INFO L226 Difference]: Without dead ends: 5836 [2019-12-26 23:43:36,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 23:43:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2019-12-26 23:43:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 4139. [2019-12-26 23:43:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2019-12-26 23:43:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 11571 transitions. [2019-12-26 23:43:36,992 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 11571 transitions. Word has length 68 [2019-12-26 23:43:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:36,992 INFO L462 AbstractCegarLoop]: Abstraction has 4139 states and 11571 transitions. [2019-12-26 23:43:36,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:43:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 11571 transitions. [2019-12-26 23:43:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:36,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:36,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:36,996 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 2 times [2019-12-26 23:43:36,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:36,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582476042] [2019-12-26 23:43:36,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:37,190 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-26 23:43:37,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582476042] [2019-12-26 23:43:37,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:37,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:43:37,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909579723] [2019-12-26 23:43:37,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:43:37,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:37,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:43:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:43:37,192 INFO L87 Difference]: Start difference. First operand 4139 states and 11571 transitions. Second operand 13 states. [2019-12-26 23:43:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:37,695 INFO L93 Difference]: Finished difference Result 7013 states and 19680 transitions. [2019-12-26 23:43:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:43:37,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-26 23:43:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:37,706 INFO L225 Difference]: With dead ends: 7013 [2019-12-26 23:43:37,706 INFO L226 Difference]: Without dead ends: 6983 [2019-12-26 23:43:37,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:43:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2019-12-26 23:43:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 4466. [2019-12-26 23:43:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-12-26 23:43:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 12510 transitions. [2019-12-26 23:43:37,791 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 12510 transitions. Word has length 68 [2019-12-26 23:43:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 12510 transitions. [2019-12-26 23:43:37,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:43:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 12510 transitions. [2019-12-26 23:43:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:37,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:37,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:37,796 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 3 times [2019-12-26 23:43:37,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:37,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360211152] [2019-12-26 23:43:37,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:38,132 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-26 23:43:38,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360211152] [2019-12-26 23:43:38,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:38,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:43:38,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086227538] [2019-12-26 23:43:38,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:43:38,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:43:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:43:38,134 INFO L87 Difference]: Start difference. First operand 4466 states and 12510 transitions. Second operand 16 states. [2019-12-26 23:43:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:39,801 INFO L93 Difference]: Finished difference Result 9639 states and 27214 transitions. [2019-12-26 23:43:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 23:43:39,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-26 23:43:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:39,813 INFO L225 Difference]: With dead ends: 9639 [2019-12-26 23:43:39,813 INFO L226 Difference]: Without dead ends: 9609 [2019-12-26 23:43:39,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=438, Invalid=1818, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:43:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2019-12-26 23:43:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 4749. [2019-12-26 23:43:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4749 states. [2019-12-26 23:43:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 13359 transitions. [2019-12-26 23:43:39,899 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 13359 transitions. Word has length 68 [2019-12-26 23:43:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:39,899 INFO L462 AbstractCegarLoop]: Abstraction has 4749 states and 13359 transitions. [2019-12-26 23:43:39,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:43:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 13359 transitions. [2019-12-26 23:43:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:39,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:39,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:39,904 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1907883765, now seen corresponding path program 4 times [2019-12-26 23:43:39,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:39,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106593641] [2019-12-26 23:43:39,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:40,315 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-26 23:43:40,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106593641] [2019-12-26 23:43:40,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:40,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:43:40,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377018434] [2019-12-26 23:43:40,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:43:40,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:43:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:43:40,316 INFO L87 Difference]: Start difference. First operand 4749 states and 13359 transitions. Second operand 18 states. [2019-12-26 23:43:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:42,796 INFO L93 Difference]: Finished difference Result 10730 states and 30253 transitions. [2019-12-26 23:43:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-26 23:43:42,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-26 23:43:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:42,810 INFO L225 Difference]: With dead ends: 10730 [2019-12-26 23:43:42,811 INFO L226 Difference]: Without dead ends: 10700 [2019-12-26 23:43:42,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=589, Invalid=2951, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 23:43:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10700 states. [2019-12-26 23:43:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10700 to 4607. [2019-12-26 23:43:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-12-26 23:43:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 12943 transitions. [2019-12-26 23:43:42,902 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 12943 transitions. Word has length 68 [2019-12-26 23:43:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:42,902 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 12943 transitions. [2019-12-26 23:43:42,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:43:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 12943 transitions. [2019-12-26 23:43:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:42,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:42,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:42,907 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 5 times [2019-12-26 23:43:42,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:42,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690170273] [2019-12-26 23:43:42,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:43,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:43:43,020 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:43:43,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2040~0.base_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2040~0.base_21| 4)) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0) (= v_~main$tmp_guard0~0_21 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21|) |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_109 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21| 1)) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2040~0.base=|v_ULTIMATE.start_main_~#t2040~0.base_21|, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_20|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2040~0.offset=|v_ULTIMATE.start_main_~#t2040~0.offset_17|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2041~0.offset, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2041~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2040~0.base, ~x~0, ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2040~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:43:43,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2041~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12|) |v_ULTIMATE.start_main_~#t2041~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2041~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2041~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2041~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2041~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:43:43,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:43:43,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2042~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2042~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2042~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9|) |v_ULTIMATE.start_main_~#t2042~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t2042~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_8|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:43:43,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1161283690 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1161283690 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1161283690|) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1161283690| ~z$w_buff0_used~0_In1161283690) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1161283690, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1161283690} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1161283690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1161283690, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1161283690} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:43:43,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1437248763 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1437248763 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1437248763 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1437248763 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1437248763|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1437248763 |P0Thread1of1ForFork0_#t~ite6_Out1437248763|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1437248763, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1437248763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437248763, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1437248763} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1437248763|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1437248763, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1437248763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437248763, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1437248763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:43:43,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In965688163 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In965688163 256)))) (or (and (= ~z$r_buff0_thd1~0_Out965688163 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out965688163 ~z$r_buff0_thd1~0_In965688163)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In965688163, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In965688163} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In965688163, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out965688163|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out965688163} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:43:43,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-471442849 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-471442849 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-471442849 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-471442849 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-471442849| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-471442849| ~z$r_buff1_thd1~0_In-471442849) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-471442849} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-471442849|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-471442849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:43:43,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:43:43,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In187793596 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In187793596 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out187793596| |P1Thread1of1ForFork1_#t~ite9_Out187793596|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In187793596 |P1Thread1of1ForFork1_#t~ite9_Out187793596|) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z~0_In187793596 |P1Thread1of1ForFork1_#t~ite9_Out187793596|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In187793596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In187793596, ~z$w_buff1~0=~z$w_buff1~0_In187793596, ~z~0=~z~0_In187793596} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out187793596|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In187793596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In187793596, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out187793596|, ~z$w_buff1~0=~z$w_buff1~0_In187793596, ~z~0=~z~0_In187793596} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:43:43,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-872920229 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-872920229 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-872920229| ~z$w_buff1~0_In-872920229) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-872920229| ~z~0_In-872920229)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872920229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872920229, ~z$w_buff1~0=~z$w_buff1~0_In-872920229, ~z~0=~z~0_In-872920229} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-872920229|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872920229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872920229, ~z$w_buff1~0=~z$w_buff1~0_In-872920229, ~z~0=~z~0_In-872920229} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:43:43,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:43:43,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-806112104 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-806112104 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-806112104| ~z$w_buff0_used~0_In-806112104)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-806112104|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-806112104, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-806112104} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-806112104, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-806112104, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-806112104|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:43:43,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1593146 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1593146 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1593146 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1593146 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out1593146| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite18_Out1593146| ~z$w_buff1_used~0_In1593146) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1593146, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1593146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1593146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1593146} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1593146, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1593146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1593146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1593146, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1593146|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:43:43,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1636640245 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1636640245 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1636640245| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-1636640245 |P2Thread1of1ForFork2_#t~ite19_Out-1636640245|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1636640245, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1636640245} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1636640245, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1636640245, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1636640245|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:43:43,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1138674683 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1138674683 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1138674683 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1138674683 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1138674683| ~z$r_buff1_thd3~0_In-1138674683) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1138674683| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138674683, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1138674683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138674683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1138674683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138674683, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1138674683|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1138674683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138674683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1138674683} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:43:43,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:43:43,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1421194313 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1421194313 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1421194313| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1421194313| ~z$w_buff0_used~0_In-1421194313) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421194313, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421194313} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421194313, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1421194313|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421194313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:43:43,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In772198849 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In772198849 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In772198849 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In772198849 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In772198849 |P1Thread1of1ForFork1_#t~ite12_Out772198849|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out772198849|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In772198849, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In772198849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772198849, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In772198849} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In772198849, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In772198849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772198849, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out772198849|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In772198849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:43:43,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1004396826 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1004396826 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1004396826| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1004396826| ~z$r_buff0_thd2~0_In1004396826) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1004396826, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1004396826} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1004396826, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1004396826|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1004396826} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:43:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In69889251 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In69889251 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In69889251 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In69889251 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out69889251| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out69889251| ~z$r_buff1_thd2~0_In69889251)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In69889251, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In69889251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69889251, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In69889251} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In69889251, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In69889251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69889251, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out69889251|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In69889251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:43:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:43:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:43:43,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In874973967 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out874973967| |ULTIMATE.start_main_#t~ite24_Out874973967|)) (.cse1 (= (mod ~z$w_buff1_used~0_In874973967 256) 0))) (or (and (= ~z~0_In874973967 |ULTIMATE.start_main_#t~ite24_Out874973967|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In874973967 |ULTIMATE.start_main_#t~ite24_Out874973967|) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874973967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874973967, ~z$w_buff1~0=~z$w_buff1~0_In874973967, ~z~0=~z~0_In874973967} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874973967, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out874973967|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874973967, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out874973967|, ~z$w_buff1~0=~z$w_buff1~0_In874973967, ~z~0=~z~0_In874973967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:43:43,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1812082760 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1812082760 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1812082760 |ULTIMATE.start_main_#t~ite26_Out1812082760|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1812082760|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1812082760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1812082760} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1812082760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1812082760, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1812082760|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:43:43,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-803202662 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-803202662 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-803202662 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-803202662 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-803202662| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-803202662 |ULTIMATE.start_main_#t~ite27_Out-803202662|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-803202662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-803202662, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-803202662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-803202662} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-803202662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-803202662, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-803202662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-803202662, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-803202662|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:43:43,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1250547525 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1250547525 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1250547525| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1250547525| ~z$r_buff0_thd0~0_In1250547525) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1250547525, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1250547525} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1250547525, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1250547525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1250547525} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:43:43,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1564618040 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1564618040 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1564618040 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1564618040 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1564618040 |ULTIMATE.start_main_#t~ite29_Out-1564618040|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-1564618040|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1564618040, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1564618040, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1564618040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1564618040} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1564618040, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1564618040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1564618040, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1564618040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1564618040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:43:43,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:43:43,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:43:43,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:43:43,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:43:43 BasicIcfg [2019-12-26 23:43:43,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:43:43,163 INFO L168 Benchmark]: Toolchain (without parser) took 103491.29 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 679.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,164 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 144.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:43:43,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.00 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.30 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,165 INFO L168 Benchmark]: Boogie Preprocessor took 45.45 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,166 INFO L168 Benchmark]: RCFGBuilder took 792.45 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 99.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,166 INFO L168 Benchmark]: TraceAbstraction took 101828.92 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 621.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:43,169 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 144.7 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.00 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.30 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.45 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.45 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 99.7 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101828.92 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 621.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4483 SDtfs, 5598 SDslu, 14694 SDs, 0 SdLazy, 10428 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 88 SyntacticMatches, 30 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 120300 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1505 NumberOfCodeBlocks, 1505 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1410 ConstructedInterpolants, 0 QuantifiedInterpolants, 370699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...