/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:35:33,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:35:33,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:35:33,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:35:33,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:35:33,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:35:33,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:35:33,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:35:33,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:35:33,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:35:33,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:35:33,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:35:33,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:35:33,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:35:33,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:35:33,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:35:33,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:35:33,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:35:33,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:35:33,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:35:33,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:35:33,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:35:33,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:35:33,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:35:33,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:35:33,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:35:33,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:35:33,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:35:33,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:35:33,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:35:33,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:35:33,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:35:33,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:35:33,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:35:33,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:35:33,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:35:33,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:35:33,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:35:33,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:35:33,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:35:33,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:35:33,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:35:33,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:35:33,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:35:33,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:35:33,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:35:33,475 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:35:33,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:35:33,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:35:33,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:35:33,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:35:33,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:35:33,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:35:33,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:35:33,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:35:33,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:35:33,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:35:33,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:35:33,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:35:33,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:35:33,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:35:33,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:35:33,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:35:33,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:35:33,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:35:33,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:35:33,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:35:33,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:35:33,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:35:33,484 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:35:33,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:35:33,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:35:33,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:35:33,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:35:33,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:35:33,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:35:33,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:35:33,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 07:35:33,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c1db60f/fe4ffed24f01451da90f31abb740d2f5/FLAGaf1fd61c5 [2019-12-27 07:35:34,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:35:34,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 07:35:34,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c1db60f/fe4ffed24f01451da90f31abb740d2f5/FLAGaf1fd61c5 [2019-12-27 07:35:34,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c1db60f/fe4ffed24f01451da90f31abb740d2f5 [2019-12-27 07:35:34,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:35:34,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:35:34,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:34,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:35:34,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:35:34,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:34" (1/1) ... [2019-12-27 07:35:34,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65149110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:34, skipping insertion in model container [2019-12-27 07:35:34,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:34" (1/1) ... [2019-12-27 07:35:34,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:35:34,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:35:35,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:35,334 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:35:35,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:35,505 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:35:35,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35 WrapperNode [2019-12-27 07:35:35,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:35,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:35,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:35:35,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:35:35,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:35,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:35:35,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:35:35,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:35:35,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... [2019-12-27 07:35:35,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:35:35,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:35:35,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:35:35,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:35:35,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:35:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:35:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:35:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:35:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:35:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:35:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:35:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:35:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:35:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:35:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:35:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:35:35,703 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:35:36,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:35:36,428 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:35:36,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:36 BoogieIcfgContainer [2019-12-27 07:35:36,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:35:36,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:35:36,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:35:36,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:35:36,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:35:34" (1/3) ... [2019-12-27 07:35:36,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd0d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:36, skipping insertion in model container [2019-12-27 07:35:36,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:35" (2/3) ... [2019-12-27 07:35:36,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd0d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:36, skipping insertion in model container [2019-12-27 07:35:36,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:36" (3/3) ... [2019-12-27 07:35:36,439 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-12-27 07:35:36,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:35:36,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:35:36,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:35:36,460 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:35:36,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:36,540 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:35:36,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:35:36,556 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:35:36,556 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:35:36,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:35:36,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:35:36,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:35:36,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:35:36,557 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:35:36,590 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 07:35:36,593 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:36,685 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:36,686 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:36,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:36,713 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:36,756 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:36,756 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:36,761 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:36,774 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 07:35:36,775 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:35:39,780 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 07:35:39,898 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 07:35:39,921 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 07:35:39,921 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 07:35:39,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:35:40,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 07:35:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 07:35:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:35:40,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:40,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:35:40,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 07:35:40,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:40,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008869780] [2019-12-27 07:35:40,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:40,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008869780] [2019-12-27 07:35:40,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:40,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:35:40,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689378258] [2019-12-27 07:35:40,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:40,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:40,707 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 07:35:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:40,958 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 07:35:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:40,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:35:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:41,086 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 07:35:41,086 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 07:35:41,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 07:35:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 07:35:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 07:35:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 07:35:41,615 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 07:35:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:41,616 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 07:35:41,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 07:35:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:35:41,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:41,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:41,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 07:35:41,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:41,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918952452] [2019-12-27 07:35:41,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:41,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918952452] [2019-12-27 07:35:41,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:41,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:41,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292830286] [2019-12-27 07:35:41,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:35:41,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:41,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:35:41,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:35:41,753 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 07:35:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:42,165 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 07:35:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:35:42,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:35:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:42,242 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 07:35:42,242 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 07:35:42,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 07:35:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 07:35:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 07:35:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 07:35:43,330 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 07:35:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:43,331 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 07:35:43,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:35:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 07:35:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:35:43,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:43,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:43,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 07:35:43,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793284886] [2019-12-27 07:35:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:43,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793284886] [2019-12-27 07:35:43,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:43,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:43,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122206280] [2019-12-27 07:35:43,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:35:43,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:35:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:35:43,427 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 07:35:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:43,468 INFO L93 Difference]: Finished difference Result 2088 states and 4835 transitions. [2019-12-27 07:35:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:35:43,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:35:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:43,474 INFO L225 Difference]: With dead ends: 2088 [2019-12-27 07:35:43,474 INFO L226 Difference]: Without dead ends: 1789 [2019-12-27 07:35:43,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-12-27 07:35:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2019-12-27 07:35:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-12-27 07:35:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 4015 transitions. [2019-12-27 07:35:43,512 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 4015 transitions. Word has length 11 [2019-12-27 07:35:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:43,512 INFO L462 AbstractCegarLoop]: Abstraction has 1789 states and 4015 transitions. [2019-12-27 07:35:43,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:35:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 4015 transitions. [2019-12-27 07:35:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:35:43,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:43,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:43,515 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1372458430, now seen corresponding path program 1 times [2019-12-27 07:35:43,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:43,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381273014] [2019-12-27 07:35:43,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:43,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381273014] [2019-12-27 07:35:43,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:43,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:43,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117719120] [2019-12-27 07:35:43,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:43,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:43,662 INFO L87 Difference]: Start difference. First operand 1789 states and 4015 transitions. Second operand 5 states. [2019-12-27 07:35:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:44,120 INFO L93 Difference]: Finished difference Result 2214 states and 4836 transitions. [2019-12-27 07:35:44,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:35:44,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 07:35:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:44,127 INFO L225 Difference]: With dead ends: 2214 [2019-12-27 07:35:44,127 INFO L226 Difference]: Without dead ends: 2214 [2019-12-27 07:35:44,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:35:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-12-27 07:35:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2001. [2019-12-27 07:35:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 07:35:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4425 transitions. [2019-12-27 07:35:44,175 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4425 transitions. Word has length 23 [2019-12-27 07:35:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:44,175 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4425 transitions. [2019-12-27 07:35:44,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4425 transitions. [2019-12-27 07:35:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:35:44,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:44,179 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-27 07:35:44,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1265331362, now seen corresponding path program 1 times [2019-12-27 07:35:44,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:44,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791106608] [2019-12-27 07:35:44,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:44,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791106608] [2019-12-27 07:35:44,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:44,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:44,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762921654] [2019-12-27 07:35:44,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:44,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:44,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:44,276 INFO L87 Difference]: Start difference. First operand 2001 states and 4425 transitions. Second operand 3 states. [2019-12-27 07:35:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:44,329 INFO L93 Difference]: Finished difference Result 2364 states and 5151 transitions. [2019-12-27 07:35:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:44,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 07:35:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:44,335 INFO L225 Difference]: With dead ends: 2364 [2019-12-27 07:35:44,336 INFO L226 Difference]: Without dead ends: 2364 [2019-12-27 07:35:44,336 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-27 07:35:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-12-27 07:35:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2145. [2019-12-27 07:35:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 07:35:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 07:35:44,384 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 37 [2019-12-27 07:35:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:44,385 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 07:35:44,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 07:35:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:35:44,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:44,390 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-27 07:35:44,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 07:35:44,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:44,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833745719] [2019-12-27 07:35:44,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833745719] [2019-12-27 07:35:44,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:44,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:35:44,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565590234] [2019-12-27 07:35:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:44,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:44,529 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 07:35:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:44,575 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 07:35:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:35:44,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:35:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:44,577 INFO L225 Difference]: With dead ends: 443 [2019-12-27 07:35:44,577 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 07:35:44,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:35:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 07:35:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 07:35:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 07:35:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 07:35:44,591 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 07:35:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:44,591 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 07:35:44,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 07:35:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:35:44,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:44,593 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] [2019-12-27 07:35:44,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 07:35:44,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:44,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913937446] [2019-12-27 07:35:44,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:44,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913937446] [2019-12-27 07:35:44,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:44,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:44,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510468485] [2019-12-27 07:35:44,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:44,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:44,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:44,716 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 3 states. [2019-12-27 07:35:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:44,730 INFO L93 Difference]: Finished difference Result 332 states and 584 transitions. [2019-12-27 07:35:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:44,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:35:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:44,734 INFO L225 Difference]: With dead ends: 332 [2019-12-27 07:35:44,735 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 07:35:44,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 07:35:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-12-27 07:35:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:35:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 07:35:44,744 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 07:35:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:44,745 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 07:35:44,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 07:35:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:35:44,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:44,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:44,747 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 07:35:44,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:44,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364870898] [2019-12-27 07:35:44,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:44,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364870898] [2019-12-27 07:35:44,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:44,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:35:44,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303796638] [2019-12-27 07:35:44,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:44,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:44,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:44,867 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 07:35:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:45,064 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 07:35:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:35:45,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 07:35:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:45,067 INFO L225 Difference]: With dead ends: 488 [2019-12-27 07:35:45,067 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 07:35:45,067 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-27 07:35:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 07:35:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 07:35:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 07:35:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 07:35:45,077 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 07:35:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:45,077 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 07:35:45,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 07:35:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:35:45,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:45,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:45,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 07:35:45,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:45,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50466237] [2019-12-27 07:35:45,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:45,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50466237] [2019-12-27 07:35:45,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:45,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:45,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260864548] [2019-12-27 07:35:45,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:45,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:45,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:45,198 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 07:35:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:45,255 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 07:35:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:45,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:35:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:45,256 INFO L225 Difference]: With dead ends: 423 [2019-12-27 07:35:45,257 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 07:35:45,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 07:35:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 07:35:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:35:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 07:35:45,264 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 07:35:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:45,264 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 07:35:45,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 07:35:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:45,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:45,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:45,266 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 07:35:45,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:45,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46769566] [2019-12-27 07:35:45,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:45,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46769566] [2019-12-27 07:35:45,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:45,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:35:45,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734626898] [2019-12-27 07:35:45,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:35:45,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:35:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:35:45,661 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 13 states. [2019-12-27 07:35:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:46,290 INFO L93 Difference]: Finished difference Result 821 states and 1400 transitions. [2019-12-27 07:35:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:35:46,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:35:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:46,291 INFO L225 Difference]: With dead ends: 821 [2019-12-27 07:35:46,291 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 07:35:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:35:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 07:35:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2019-12-27 07:35:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 07:35:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 07:35:46,296 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 07:35:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:46,297 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 07:35:46,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:35:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 07:35:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:46,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:46,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:46,298 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 07:35:46,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:46,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805881231] [2019-12-27 07:35:46,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:46,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805881231] [2019-12-27 07:35:46,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:46,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:35:46,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465031298] [2019-12-27 07:35:46,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:35:46,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:35:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:35:46,643 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 17 states. [2019-12-27 07:35:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:47,896 INFO L93 Difference]: Finished difference Result 514 states and 887 transitions. [2019-12-27 07:35:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:35:47,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 07:35:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:47,897 INFO L225 Difference]: With dead ends: 514 [2019-12-27 07:35:47,897 INFO L226 Difference]: Without dead ends: 480 [2019-12-27 07:35:47,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:35:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-27 07:35:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 332. [2019-12-27 07:35:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:35:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 07:35:47,904 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 54 [2019-12-27 07:35:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:47,905 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 07:35:47,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:35:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 07:35:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:47,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:47,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:47,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1446676572, now seen corresponding path program 3 times [2019-12-27 07:35:47,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:47,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207703572] [2019-12-27 07:35:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:48,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207703572] [2019-12-27 07:35:48,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 07:35:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312975961] [2019-12-27 07:35:48,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 07:35:48,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 07:35:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:35:48,347 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 19 states. [2019-12-27 07:35:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:49,129 INFO L93 Difference]: Finished difference Result 710 states and 1216 transitions. [2019-12-27 07:35:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:35:49,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-27 07:35:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:49,132 INFO L225 Difference]: With dead ends: 710 [2019-12-27 07:35:49,132 INFO L226 Difference]: Without dead ends: 676 [2019-12-27 07:35:49,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2019-12-27 07:35:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-27 07:35:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 349. [2019-12-27 07:35:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 07:35:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 617 transitions. [2019-12-27 07:35:49,141 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 617 transitions. Word has length 54 [2019-12-27 07:35:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:49,141 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 617 transitions. [2019-12-27 07:35:49,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 07:35:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 617 transitions. [2019-12-27 07:35:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:49,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:49,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:49,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1203117294, now seen corresponding path program 4 times [2019-12-27 07:35:49,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:49,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255354329] [2019-12-27 07:35:49,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:49,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-27 07:35:49,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255354329] [2019-12-27 07:35:49,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:49,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:35:49,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87952897] [2019-12-27 07:35:49,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:35:49,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:35:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:35:49,317 INFO L87 Difference]: Start difference. First operand 349 states and 617 transitions. Second operand 12 states. [2019-12-27 07:35:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:49,846 INFO L93 Difference]: Finished difference Result 541 states and 918 transitions. [2019-12-27 07:35:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:35:49,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 07:35:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:49,848 INFO L225 Difference]: With dead ends: 541 [2019-12-27 07:35:49,848 INFO L226 Difference]: Without dead ends: 507 [2019-12-27 07:35:49,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:35:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-27 07:35:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 328. [2019-12-27 07:35:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 07:35:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 575 transitions. [2019-12-27 07:35:49,855 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 575 transitions. Word has length 54 [2019-12-27 07:35:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:49,856 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 575 transitions. [2019-12-27 07:35:49,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:35:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 575 transitions. [2019-12-27 07:35:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:49,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:49,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:49,857 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash 932780242, now seen corresponding path program 5 times [2019-12-27 07:35:49,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:49,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756749451] [2019-12-27 07:35:49,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756749451] [2019-12-27 07:35:50,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:50,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:35:50,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925197821] [2019-12-27 07:35:50,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:35:50,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:35:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:35:50,034 INFO L87 Difference]: Start difference. First operand 328 states and 575 transitions. Second operand 12 states. [2019-12-27 07:35:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:50,345 INFO L93 Difference]: Finished difference Result 432 states and 731 transitions. [2019-12-27 07:35:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:35:50,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 07:35:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:50,347 INFO L225 Difference]: With dead ends: 432 [2019-12-27 07:35:50,347 INFO L226 Difference]: Without dead ends: 398 [2019-12-27 07:35:50,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:35:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-27 07:35:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 330. [2019-12-27 07:35:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 07:35:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 07:35:50,353 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 07:35:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:50,354 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 07:35:50,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:35:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 07:35:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:35:50,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:50,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:50,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 6 times [2019-12-27 07:35:50,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:50,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974656366] [2019-12-27 07:35:50,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:35:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:35:50,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:35:50,478 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:35:50,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24|)) (= |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24| 1)) (= v_~y~0_29 0) (= 0 v_~y$r_buff1_thd0~0_50) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2013~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2013~0.base_24|) |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0)) |v_#memory_int_9|) (= 0 v_~y$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2013~0.base_24|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2013~0.base_24| 4) |v_#length_11|) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_20|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_17|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2013~0.offset=|v_ULTIMATE.start_main_~#t2013~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_~#t2013~0.base=|v_ULTIMATE.start_main_~#t2013~0.base_24|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_~#t2014~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2014~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2013~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2013~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:35:50,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2014~0.base_11|)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2014~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t2014~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) |v_ULTIMATE.start_main_~#t2014~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2014~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2014~0.base] because there is no mapped edge [2019-12-27 07:35:50,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:35:50,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In563510053 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In563510053 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out563510053| ~y$w_buff1~0_In563510053) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out563510053| ~y~0_In563510053) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In563510053, ~y$w_buff1~0=~y$w_buff1~0_In563510053, ~y~0=~y~0_In563510053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563510053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In563510053, ~y$w_buff1~0=~y$w_buff1~0_In563510053, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out563510053|, ~y~0=~y~0_In563510053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563510053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:35:50,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:35:50,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-116536008 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-116536008 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-116536008 |P1Thread1of1ForFork1_#t~ite11_Out-116536008|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-116536008| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-116536008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-116536008, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-116536008|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:35:50,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In570552776 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In570552776 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In570552776 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In570552776 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out570552776| ~y$w_buff1_used~0_In570552776) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out570552776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In570552776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570552776} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In570552776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out570552776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570552776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:35:50,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1947577741 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1947577741 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1947577741 |P1Thread1of1ForFork1_#t~ite13_Out1947577741|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1947577741|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1947577741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1947577741} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1947577741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1947577741, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1947577741|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:35:50,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1360740081 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1360740081 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1360740081 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1360740081 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1360740081 |P1Thread1of1ForFork1_#t~ite14_Out-1360740081|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1360740081|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1360740081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1360740081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360740081} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1360740081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1360740081, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1360740081|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360740081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:35:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:35:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1161399998 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1161399998 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1161399998| 0)) (and (= ~y$w_buff0_used~0_In-1161399998 |P0Thread1of1ForFork0_#t~ite5_Out-1161399998|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1161399998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1161399998} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1161399998|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1161399998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1161399998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:35:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2134062698 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2134062698 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2134062698 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2134062698 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2134062698|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-2134062698 |P0Thread1of1ForFork0_#t~ite6_Out-2134062698|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2134062698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2134062698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2134062698} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2134062698|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2134062698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2134062698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2134062698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:35:50,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1381657299 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1381657299 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1381657299 ~y$r_buff0_thd1~0_Out-1381657299)) (and (= 0 ~y$r_buff0_thd1~0_Out-1381657299) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381657299, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1381657299} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381657299, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1381657299|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1381657299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:35:50,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2095444268 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2095444268 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2095444268 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2095444268 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2095444268|)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2095444268| ~y$r_buff1_thd1~0_In-2095444268) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2095444268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2095444268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095444268} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2095444268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2095444268|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2095444268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095444268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:35:50,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:35:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:35:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| |ULTIMATE.start_main_#t~ite18_Out1909093746|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1909093746 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1909093746 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| ~y$w_buff1~0_In1909093746) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| ~y~0_In1909093746) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1909093746, ~y~0=~y~0_In1909093746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909093746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909093746} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1909093746|, ~y$w_buff1~0=~y$w_buff1~0_In1909093746, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1909093746|, ~y~0=~y~0_In1909093746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909093746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909093746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 07:35:50,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1891281984 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1891281984 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1891281984 |ULTIMATE.start_main_#t~ite19_Out-1891281984|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1891281984|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1891281984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1891281984} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1891281984, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1891281984|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1891281984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:35:50,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-115851850 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-115851850 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-115851850 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-115851850 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-115851850|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-115851850| ~y$w_buff1_used~0_In-115851850) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115851850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115851850, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-115851850|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:35:50,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1659990637 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1659990637 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1659990637|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1659990637 |ULTIMATE.start_main_#t~ite21_Out-1659990637|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659990637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659990637} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659990637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659990637, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1659990637|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:35:50,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In438984902 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In438984902 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In438984902 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In438984902 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out438984902|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out438984902| ~y$r_buff1_thd0~0_In438984902) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out438984902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:35:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In735408909 256)))) (or (and .cse0 (= ~y$w_buff1~0_In735408909 |ULTIMATE.start_main_#t~ite31_Out735408909|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In735408909 256)))) (or (and (= (mod ~y$w_buff1_used~0_In735408909 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In735408909 256))) (= (mod ~y$w_buff0_used~0_In735408909 256) 0))) (= |ULTIMATE.start_main_#t~ite32_Out735408909| |ULTIMATE.start_main_#t~ite31_Out735408909|)) (and (= |ULTIMATE.start_main_#t~ite31_In735408909| |ULTIMATE.start_main_#t~ite31_Out735408909|) (not .cse0) (= ~y$w_buff1~0_In735408909 |ULTIMATE.start_main_#t~ite32_Out735408909|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In735408909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735408909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In735408909, ~weak$$choice2~0=~weak$$choice2~0_In735408909, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In735408909|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In735408909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735408909} OutVars{~y$w_buff1~0=~y$w_buff1~0_In735408909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735408909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In735408909, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out735408909|, ~weak$$choice2~0=~weak$$choice2~0_In735408909, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out735408909|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In735408909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735408909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 07:35:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 07:35:50,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:35:50,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:35:50,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:35:50 BasicIcfg [2019-12-27 07:35:50,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:35:50,589 INFO L168 Benchmark]: Toolchain (without parser) took 15861.11 ms. Allocated memory was 146.3 MB in the beginning and 593.0 MB in the end (delta: 446.7 MB). Free memory was 102.7 MB in the beginning and 326.2 MB in the end (delta: -223.5 MB). Peak memory consumption was 223.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,589 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.87 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.83 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,594 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,597 INFO L168 Benchmark]: RCFGBuilder took 800.36 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.5 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,598 INFO L168 Benchmark]: TraceAbstraction took 14155.95 ms. Allocated memory was 203.4 MB in the beginning and 593.0 MB in the end (delta: 389.5 MB). Free memory was 108.5 MB in the beginning and 326.2 MB in the end (delta: -217.7 MB). Peak memory consumption was 171.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:50,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.87 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.83 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.65 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.36 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.5 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14155.95 ms. Allocated memory was 203.4 MB in the beginning and 593.0 MB in the end (delta: 389.5 MB). Free memory was 108.5 MB in the beginning and 326.2 MB in the end (delta: -217.7 MB). Peak memory consumption was 171.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1505 SDtfs, 1664 SDslu, 5081 SDs, 0 SdLazy, 3296 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13161occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2629 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 145471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...