/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:42:35,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:42:35,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:42:35,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:42:35,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:42:35,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:42:35,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:42:35,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:42:35,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:42:35,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:42:35,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:42:35,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:42:35,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:42:35,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:42:35,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:42:35,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:42:35,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:42:35,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:42:35,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:42:35,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:42:35,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:42:35,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:42:35,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:42:35,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:42:35,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:42:35,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:42:35,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:42:35,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:42:35,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:42:35,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:42:35,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:42:35,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:42:35,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:42:35,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:42:35,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:42:35,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:42:35,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:42:35,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:42:35,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:42:35,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:42:35,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:42:35,449 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-SemanticLbe.epf [2019-12-27 02:42:35,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:42:35,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:42:35,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:42:35,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:42:35,479 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:42:35,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:42:35,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:42:35,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:42:35,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:42:35,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:42:35,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:42:35,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:42:35,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:42:35,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:42:35,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:42:35,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:42:35,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:42:35,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:42:35,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:42:35,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:42:35,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:42:35,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:42:35,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:42:35,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:42:35,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:42:35,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:42:35,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:42:35,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:42:35,830 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:42:35,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-27 02:42:35,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c3738bc/e8ca016f0ded4613a936ee9968824b51/FLAGf58bb481d [2019-12-27 02:42:36,474 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:42:36,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-27 02:42:36,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c3738bc/e8ca016f0ded4613a936ee9968824b51/FLAGf58bb481d [2019-12-27 02:42:36,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c3738bc/e8ca016f0ded4613a936ee9968824b51 [2019-12-27 02:42:36,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:42:36,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:42:36,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:42:36,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:42:36,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:42:36,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:42:36" (1/1) ... [2019-12-27 02:42:36,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:36, skipping insertion in model container [2019-12-27 02:42:36,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:42:36" (1/1) ... [2019-12-27 02:42:36,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:42:36,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:42:37,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:42:37,389 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:42:37,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:42:37,531 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:42:37,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37 WrapperNode [2019-12-27 02:42:37,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:42:37,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:42:37,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:42:37,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:42:37,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:42:37,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:42:37,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:42:37,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:42:37,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (1/1) ... [2019-12-27 02:42:37,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:42:37,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:42:37,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:42:37,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:42:37,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (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 02:42:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:42:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:42:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:42:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:42:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:42:37,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:42:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:42:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:42:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:42:37,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:42:37,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:42:37,736 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 02:42:38,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:42:38,530 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:42:38,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:42:38 BoogieIcfgContainer [2019-12-27 02:42:38,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:42:38,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:42:38,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:42:38,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:42:38,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:42:36" (1/3) ... [2019-12-27 02:42:38,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3e8c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:42:38, skipping insertion in model container [2019-12-27 02:42:38,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:42:37" (2/3) ... [2019-12-27 02:42:38,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3e8c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:42:38, skipping insertion in model container [2019-12-27 02:42:38,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:42:38" (3/3) ... [2019-12-27 02:42:38,541 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2019-12-27 02:42:38,551 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:42:38,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:42:38,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:42:38,560 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:42:38,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,660 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:42:38,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:42:38,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:42:38,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:42:38,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:42:38,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:42:38,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:42:38,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:42:38,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:42:38,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:42:38,715 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 02:42:38,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 02:42:38,846 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 02:42:38,846 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:42:38,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:42:38,879 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 02:42:38,958 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 02:42:38,959 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:42:38,965 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:42:38,980 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:42:38,981 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:42:44,366 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:42:44,521 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:42:44,581 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-27 02:42:44,581 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 02:42:44,584 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-27 02:42:46,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-27 02:42:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-27 02:42:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:42:46,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:46,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:42:46,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-27 02:42:46,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:46,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596693820] [2019-12-27 02:42:46,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:42:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:42:47,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596693820] [2019-12-27 02:42:47,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:42:47,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:42:47,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866643561] [2019-12-27 02:42:47,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:42:47,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:42:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:42:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:42:47,185 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-27 02:42:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:42:48,959 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-27 02:42:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:42:48,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:42:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:42:49,365 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 02:42:49,366 INFO L226 Difference]: Without dead ends: 33638 [2019-12-27 02:42:49,367 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 02:42:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-27 02:42:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-27 02:42:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-27 02:42:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-27 02:42:51,385 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-27 02:42:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:42:51,387 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-27 02:42:51,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:42:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-27 02:42:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:42:51,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:51,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:42:51,395 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-27 02:42:51,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:51,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670473377] [2019-12-27 02:42:51,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:42:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:42:51,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670473377] [2019-12-27 02:42:51,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:42:51,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:42:51,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723665614] [2019-12-27 02:42:51,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:42:51,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:42:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:42:51,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:42:51,490 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-27 02:42:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:42:52,503 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-27 02:42:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:42:52,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:42:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:42:54,629 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 02:42:54,629 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 02:42:54,632 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 02:42:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 02:42:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-27 02:42:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-27 02:42:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-27 02:42:56,822 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-27 02:42:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:42:56,823 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-27 02:42:56,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:42:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-27 02:42:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:42:56,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:56,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:42:56,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-27 02:42:56,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:56,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975780151] [2019-12-27 02:42:56,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:42:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:42:56,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975780151] [2019-12-27 02:42:56,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:42:56,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:42:56,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48535487] [2019-12-27 02:42:56,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:42:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:42:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:42:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:42:56,924 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-27 02:42:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:42:57,120 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-27 02:42:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:42:57,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:42:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:42:57,352 INFO L225 Difference]: With dead ends: 37462 [2019-12-27 02:42:57,352 INFO L226 Difference]: Without dead ends: 37462 [2019-12-27 02:42:57,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:42:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-27 02:42:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-27 02:42:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-27 02:42:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-27 02:42:58,967 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-27 02:42:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:42:58,967 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-27 02:42:58,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:42:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-27 02:42:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:42:58,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:58,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:42:58,970 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-27 02:42:58,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:58,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788194478] [2019-12-27 02:42:58,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:42:59,033 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 02:42:59,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788194478] [2019-12-27 02:42:59,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:42:59,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:42:59,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666251841] [2019-12-27 02:42:59,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:42:59,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:42:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:42:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:42:59,035 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-27 02:42:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:42:59,112 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-27 02:42:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:42:59,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:42:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:42:59,144 INFO L225 Difference]: With dead ends: 15610 [2019-12-27 02:42:59,144 INFO L226 Difference]: Without dead ends: 15610 [2019-12-27 02:42:59,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:42:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-27 02:42:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-27 02:42:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-27 02:42:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-27 02:42:59,791 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-27 02:42:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:42:59,792 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-27 02:42:59,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:42:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-27 02:42:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:42:59,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:59,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:42:59,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-27 02:42:59,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:59,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267705231] [2019-12-27 02:42:59,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:42:59,851 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 02:42:59,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267705231] [2019-12-27 02:42:59,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:42:59,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:42:59,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246873144] [2019-12-27 02:42:59,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:42:59,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:42:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:42:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:42:59,854 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-27 02:42:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:42:59,903 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-27 02:42:59,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:42:59,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 02:42:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:42:59,908 INFO L225 Difference]: With dead ends: 2718 [2019-12-27 02:42:59,908 INFO L226 Difference]: Without dead ends: 2718 [2019-12-27 02:42:59,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:42:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-27 02:42:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-27 02:42:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-27 02:42:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-27 02:42:59,950 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-27 02:42:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:42:59,950 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-27 02:42:59,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:42:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-27 02:42:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:42:59,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:42:59,955 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] [2019-12-27 02:42:59,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:42:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:42:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-27 02:42:59,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:42:59,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902833143] [2019-12-27 02:42:59,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:42:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:00,040 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 02:43:00,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902833143] [2019-12-27 02:43:00,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:00,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:43:00,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437728533] [2019-12-27 02:43:00,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:00,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:00,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:00,042 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-27 02:43:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:00,094 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-27 02:43:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:43:00,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:43:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:00,097 INFO L225 Difference]: With dead ends: 1354 [2019-12-27 02:43:00,097 INFO L226 Difference]: Without dead ends: 1354 [2019-12-27 02:43:00,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-27 02:43:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-27 02:43:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 02:43:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-27 02:43:00,114 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-27 02:43:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:00,115 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-27 02:43:00,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-27 02:43:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:00,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:00,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:00,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:00,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:00,120 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-27 02:43:00,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:00,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087177487] [2019-12-27 02:43:00,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:00,264 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 02:43:00,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087177487] [2019-12-27 02:43:00,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:00,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:43:00,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62686015] [2019-12-27 02:43:00,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:00,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:00,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:00,267 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-27 02:43:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:00,309 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-27 02:43:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:00,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 02:43:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:00,312 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 02:43:00,313 INFO L226 Difference]: Without dead ends: 1222 [2019-12-27 02:43:00,313 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 02:43:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-27 02:43:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-27 02:43:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 02:43:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-27 02:43:00,334 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-27 02:43:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:00,336 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-27 02:43:00,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-27 02:43:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:00,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:00,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:00,344 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-27 02:43:00,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:00,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671338050] [2019-12-27 02:43:00,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:00,506 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 02:43:00,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671338050] [2019-12-27 02:43:00,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:00,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:43:00,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502243142] [2019-12-27 02:43:00,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:43:00,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:43:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:43:00,509 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-27 02:43:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:00,761 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-27 02:43:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:43:00,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 02:43:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:00,766 INFO L225 Difference]: With dead ends: 1758 [2019-12-27 02:43:00,766 INFO L226 Difference]: Without dead ends: 1758 [2019-12-27 02:43:00,767 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 02:43:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-27 02:43:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-27 02:43:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-27 02:43:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-27 02:43:00,792 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-27 02:43:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-27 02:43:00,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:43:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-27 02:43:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:00,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:00,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:00,799 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-27 02:43:00,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:00,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965745384] [2019-12-27 02:43:00,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:00,947 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 02:43:00,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965745384] [2019-12-27 02:43:00,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:00,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:43:00,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522272793] [2019-12-27 02:43:00,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:00,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:00,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:00,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:00,949 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-27 02:43:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:01,370 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-27 02:43:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:43:01,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 02:43:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:01,376 INFO L225 Difference]: With dead ends: 2360 [2019-12-27 02:43:01,376 INFO L226 Difference]: Without dead ends: 2360 [2019-12-27 02:43:01,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:43:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-27 02:43:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-27 02:43:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-27 02:43:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-27 02:43:01,404 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-27 02:43:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:01,405 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-27 02:43:01,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-27 02:43:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:01,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:01,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:01,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-27 02:43:01,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:01,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324102024] [2019-12-27 02:43:01,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:01,519 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 02:43:01,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324102024] [2019-12-27 02:43:01,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:01,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:43:01,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927221517] [2019-12-27 02:43:01,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:01,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:01,521 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-27 02:43:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:01,927 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-27 02:43:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:43:01,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 02:43:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:01,935 INFO L225 Difference]: With dead ends: 2371 [2019-12-27 02:43:01,935 INFO L226 Difference]: Without dead ends: 2371 [2019-12-27 02:43:01,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:43:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-27 02:43:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-27 02:43:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-27 02:43:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-27 02:43:01,977 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-27 02:43:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:01,977 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-27 02:43:01,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-27 02:43:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:01,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:01,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:01,983 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-27 02:43:01,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:01,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180529861] [2019-12-27 02:43:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:02,168 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 02:43:02,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180529861] [2019-12-27 02:43:02,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:02,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:43:02,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572130932] [2019-12-27 02:43:02,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:02,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:02,170 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 6 states. [2019-12-27 02:43:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:02,255 INFO L93 Difference]: Finished difference Result 2401 states and 6550 transitions. [2019-12-27 02:43:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:43:02,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 02:43:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:02,260 INFO L225 Difference]: With dead ends: 2401 [2019-12-27 02:43:02,260 INFO L226 Difference]: Without dead ends: 1539 [2019-12-27 02:43:02,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:43:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-27 02:43:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-12-27 02:43:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-12-27 02:43:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 4361 transitions. [2019-12-27 02:43:02,285 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 4361 transitions. Word has length 58 [2019-12-27 02:43:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:02,286 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 4361 transitions. [2019-12-27 02:43:02,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 4361 transitions. [2019-12-27 02:43:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:43:02,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:02,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:02,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash 890823083, now seen corresponding path program 5 times [2019-12-27 02:43:02,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:02,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963100842] [2019-12-27 02:43:02,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:02,356 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 02:43:02,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963100842] [2019-12-27 02:43:02,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:02,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:43:02,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420890413] [2019-12-27 02:43:02,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:02,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:02,358 INFO L87 Difference]: Start difference. First operand 1539 states and 4361 transitions. Second operand 3 states. [2019-12-27 02:43:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:02,383 INFO L93 Difference]: Finished difference Result 1355 states and 3763 transitions. [2019-12-27 02:43:02,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:02,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 02:43:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:02,386 INFO L225 Difference]: With dead ends: 1355 [2019-12-27 02:43:02,386 INFO L226 Difference]: Without dead ends: 1355 [2019-12-27 02:43:02,386 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 02:43:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-27 02:43:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2019-12-27 02:43:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-12-27 02:43:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 3763 transitions. [2019-12-27 02:43:02,409 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 3763 transitions. Word has length 58 [2019-12-27 02:43:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:02,410 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 3763 transitions. [2019-12-27 02:43:02,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 3763 transitions. [2019-12-27 02:43:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:43:02,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:02,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:02,414 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2057740932, now seen corresponding path program 1 times [2019-12-27 02:43:02,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:02,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727271365] [2019-12-27 02:43:02,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:02,586 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 02:43:02,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727271365] [2019-12-27 02:43:02,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:02,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:43:02,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601349868] [2019-12-27 02:43:02,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:43:02,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:43:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:43:02,589 INFO L87 Difference]: Start difference. First operand 1355 states and 3763 transitions. Second operand 5 states. [2019-12-27 02:43:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:02,669 INFO L93 Difference]: Finished difference Result 1693 states and 4373 transitions. [2019-12-27 02:43:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:43:02,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 02:43:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:02,672 INFO L225 Difference]: With dead ends: 1693 [2019-12-27 02:43:02,673 INFO L226 Difference]: Without dead ends: 997 [2019-12-27 02:43:02,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:43:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-27 02:43:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-27 02:43:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-27 02:43:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2436 transitions. [2019-12-27 02:43:02,696 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2436 transitions. Word has length 59 [2019-12-27 02:43:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:02,697 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 2436 transitions. [2019-12-27 02:43:02,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:43:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2436 transitions. [2019-12-27 02:43:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:43:02,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:02,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:02,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1752832322, now seen corresponding path program 2 times [2019-12-27 02:43:02,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:02,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384621822] [2019-12-27 02:43:02,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:02,776 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 02:43:02,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384621822] [2019-12-27 02:43:02,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:02,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:43:02,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117145282] [2019-12-27 02:43:02,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:02,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:02,778 INFO L87 Difference]: Start difference. First operand 997 states and 2436 transitions. Second operand 3 states. [2019-12-27 02:43:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:02,844 INFO L93 Difference]: Finished difference Result 997 states and 2435 transitions. [2019-12-27 02:43:02,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:02,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 02:43:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:02,847 INFO L225 Difference]: With dead ends: 997 [2019-12-27 02:43:02,848 INFO L226 Difference]: Without dead ends: 997 [2019-12-27 02:43:02,848 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 02:43:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-27 02:43:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 600. [2019-12-27 02:43:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-27 02:43:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-27 02:43:02,866 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 59 [2019-12-27 02:43:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:02,866 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-27 02:43:02,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-27 02:43:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:43:02,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:02,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:02,869 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 1 times [2019-12-27 02:43:02,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:02,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85497371] [2019-12-27 02:43:02,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:43:03,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85497371] [2019-12-27 02:43:03,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:03,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:43:03,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204974071] [2019-12-27 02:43:03,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:03,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:03,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:03,040 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 6 states. [2019-12-27 02:43:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:03,172 INFO L93 Difference]: Finished difference Result 985 states and 2333 transitions. [2019-12-27 02:43:03,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:43:03,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 02:43:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:03,174 INFO L225 Difference]: With dead ends: 985 [2019-12-27 02:43:03,174 INFO L226 Difference]: Without dead ends: 264 [2019-12-27 02:43:03,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:43:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-27 02:43:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-12-27 02:43:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-27 02:43:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-27 02:43:03,179 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-27 02:43:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:03,180 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-27 02:43:03,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-27 02:43:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:43:03,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:03,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:03,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 2 times [2019-12-27 02:43:03,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:03,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762447287] [2019-12-27 02:43:03,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:43:03,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762447287] [2019-12-27 02:43:03,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:03,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:43:03,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187084785] [2019-12-27 02:43:03,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:43:03,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:43:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:43:03,558 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-27 02:43:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:04,231 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2019-12-27 02:43:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:43:04,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 02:43:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:04,232 INFO L225 Difference]: With dead ends: 386 [2019-12-27 02:43:04,232 INFO L226 Difference]: Without dead ends: 358 [2019-12-27 02:43:04,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:43:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-27 02:43:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-12-27 02:43:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 02:43:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-27 02:43:04,238 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-27 02:43:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:04,238 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-27 02:43:04,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:43:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-27 02:43:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:43:04,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:04,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:04,240 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 3 times [2019-12-27 02:43:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:04,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272170327] [2019-12-27 02:43:04,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:04,577 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 02:43:04,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272170327] [2019-12-27 02:43:04,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:04,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:43:04,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713859722] [2019-12-27 02:43:04,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:43:04,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:43:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:43:04,581 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-27 02:43:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:05,256 INFO L93 Difference]: Finished difference Result 458 states and 779 transitions. [2019-12-27 02:43:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:43:05,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 02:43:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:05,258 INFO L225 Difference]: With dead ends: 458 [2019-12-27 02:43:05,258 INFO L226 Difference]: Without dead ends: 430 [2019-12-27 02:43:05,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:43:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-27 02:43:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 332. [2019-12-27 02:43:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 02:43:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-27 02:43:05,264 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-27 02:43:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:05,264 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-27 02:43:05,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:43:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-27 02:43:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:43:05,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:05,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:05,265 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:05,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 4 times [2019-12-27 02:43:05,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:05,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061733572] [2019-12-27 02:43:05,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:05,585 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 02:43:05,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061733572] [2019-12-27 02:43:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:43:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786384936] [2019-12-27 02:43:05,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 02:43:05,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 02:43:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:43:05,587 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 14 states. [2019-12-27 02:43:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:06,344 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-27 02:43:06,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:43:06,345 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 02:43:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:06,346 INFO L225 Difference]: With dead ends: 446 [2019-12-27 02:43:06,346 INFO L226 Difference]: Without dead ends: 418 [2019-12-27 02:43:06,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:43:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-27 02:43:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-27 02:43:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 02:43:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-27 02:43:06,351 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-27 02:43:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:06,351 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-27 02:43:06,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 02:43:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-27 02:43:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:43:06,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:06,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:06,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 5 times [2019-12-27 02:43:06,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:06,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043434394] [2019-12-27 02:43:06,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:43:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:43:06,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:43:06,466 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:43:06,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1273~0.base_21|) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21| 1)) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21|) |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0)) |v_#memory_int_23|) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1273~0.base_21| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_23|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1273~0.offset=|v_ULTIMATE.start_main_~#t1273~0.offset_17|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_18|, ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1273~0.base=|v_ULTIMATE.start_main_~#t1273~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1273~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1276~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1275~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1275~0.offset, ULTIMATE.start_main_~#t1274~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1273~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:43:06,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1274~0.base_13| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13|) |v_ULTIMATE.start_main_~#t1274~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t1274~0.offset_11| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1274~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1274~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.offset, ULTIMATE.start_main_~#t1274~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 02:43:06,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1275~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1275~0.base_11|) (= |v_ULTIMATE.start_main_~#t1275~0.offset_10| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11|) 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1275~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11|) |v_ULTIMATE.start_main_~#t1275~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_11|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1275~0.base, ULTIMATE.start_main_~#t1275~0.offset] because there is no mapped edge [2019-12-27 02:43:06,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1276~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1276~0.base_13|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1276~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13|) |v_ULTIMATE.start_main_~#t1276~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1276~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_13|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1276~0.base, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.offset] because there is no mapped edge [2019-12-27 02:43:06,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:43:06,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:43:06,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:43:06,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In581557938 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In581557938 256)))) (or (and (= ~z$w_buff0_used~0_In581557938 |P3Thread1of1ForFork3_#t~ite11_Out581557938|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out581557938|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In581557938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In581557938} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In581557938, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In581557938, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out581557938|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:43:06,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1081184254 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1081184254 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1081184254 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1081184254 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1081184254| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out-1081184254| ~z$w_buff1_used~0_In-1081184254) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1081184254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081184254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1081184254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1081184254} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1081184254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081184254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1081184254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1081184254, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1081184254|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 02:43:06,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1878626010 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1878626010 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1878626010 |P2Thread1of1ForFork2_#t~ite3_Out1878626010|)) (and (not .cse0) (= ~z$w_buff1~0_In1878626010 |P2Thread1of1ForFork2_#t~ite3_Out1878626010|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1878626010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1878626010, ~z$w_buff1~0=~z$w_buff1~0_In1878626010, ~z~0=~z~0_In1878626010} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1878626010|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1878626010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1878626010, ~z$w_buff1~0=~z$w_buff1~0_In1878626010, ~z~0=~z~0_In1878626010} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:43:06,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 02:43:06,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1656828359 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1656828359 256)))) (or (and (= ~z$w_buff0_used~0_In1656828359 |P2Thread1of1ForFork2_#t~ite5_Out1656828359|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1656828359|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1656828359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1656828359} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1656828359|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1656828359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1656828359} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:43:06,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1867863897 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1867863897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1867863897 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1867863897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out1867863897| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out1867863897| ~z$w_buff1_used~0_In1867863897) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1867863897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1867863897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1867863897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1867863897} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1867863897|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1867863897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1867863897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1867863897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1867863897} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:43:06,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-775694262 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-775694262 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-775694262| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-775694262| ~z$r_buff0_thd3~0_In-775694262) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-775694262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-775694262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-775694262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-775694262, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-775694262|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:43:06,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In452237055 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In452237055 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In452237055 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In452237055 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In452237055 |P2Thread1of1ForFork2_#t~ite8_Out452237055|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out452237055|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In452237055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452237055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452237055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In452237055} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In452237055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452237055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452237055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In452237055, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out452237055|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:43:06,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:43:06,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1911273253 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1911273253 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-1911273253) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_In-1911273253 ~z$r_buff0_thd4~0_Out-1911273253) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911273253, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1911273253} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911273253, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1911273253, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1911273253|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 02:43:06,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1071979003 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1071979003 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1071979003 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1071979003 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1071979003|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out1071979003| ~z$r_buff1_thd4~0_In1071979003)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1071979003, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1071979003, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1071979003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1071979003} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1071979003, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1071979003, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1071979003|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1071979003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1071979003} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 02:43:06,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:43:06,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 02:43:06,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite20_Out-416095277| |ULTIMATE.start_main_#t~ite19_Out-416095277|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-416095277 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-416095277 256) 0))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-416095277 |ULTIMATE.start_main_#t~ite19_Out-416095277|) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~z~0_In-416095277 |ULTIMATE.start_main_#t~ite19_Out-416095277|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-416095277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-416095277, ~z$w_buff1~0=~z$w_buff1~0_In-416095277, ~z~0=~z~0_In-416095277} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-416095277|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-416095277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-416095277, ~z$w_buff1~0=~z$w_buff1~0_In-416095277, ~z~0=~z~0_In-416095277, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-416095277|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:43:06,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-29081063 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-29081063 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-29081063|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-29081063 |ULTIMATE.start_main_#t~ite21_Out-29081063|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-29081063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-29081063} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-29081063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-29081063, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-29081063|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:43:06,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2022757358 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2022757358 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2022757358 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2022757358 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2022757358|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2022757358 |ULTIMATE.start_main_#t~ite22_Out-2022757358|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2022757358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022757358, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2022757358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022757358} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2022757358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022757358, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2022757358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022757358, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2022757358|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:43:06,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1754991134 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1754991134 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-1754991134| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1754991134 |ULTIMATE.start_main_#t~ite23_Out-1754991134|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1754991134, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1754991134} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1754991134, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1754991134, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1754991134|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:43:06,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1302626871 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1302626871 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1302626871 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1302626871 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out1302626871|)) (and (= ~z$r_buff1_thd0~0_In1302626871 |ULTIMATE.start_main_#t~ite24_Out1302626871|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1302626871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1302626871, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1302626871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302626871} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1302626871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1302626871, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1302626871, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1302626871|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302626871} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:43:06,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In39670719 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In39670719 256)))) (or (and (= (mod ~z$w_buff1_used~0_In39670719 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd0~0_In39670719 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In39670719 256) 0))) (= |ULTIMATE.start_main_#t~ite31_Out39670719| |ULTIMATE.start_main_#t~ite30_Out39670719|) .cse1 (= ~z$w_buff0~0_In39670719 |ULTIMATE.start_main_#t~ite30_Out39670719|)) (and (= ~z$w_buff0~0_In39670719 |ULTIMATE.start_main_#t~ite31_Out39670719|) (= |ULTIMATE.start_main_#t~ite30_In39670719| |ULTIMATE.start_main_#t~ite30_Out39670719|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In39670719, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In39670719|, ~z$w_buff0~0=~z$w_buff0~0_In39670719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In39670719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In39670719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39670719, ~weak$$choice2~0=~weak$$choice2~0_In39670719} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In39670719, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out39670719|, ~z$w_buff0~0=~z$w_buff0~0_In39670719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In39670719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In39670719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In39670719, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out39670719|, ~weak$$choice2~0=~weak$$choice2~0_In39670719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 02:43:06,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In509581333 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out509581333| |ULTIMATE.start_main_#t~ite33_Out509581333|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In509581333 256)))) (or (= (mod ~z$w_buff0_used~0_In509581333 256) 0) (and (= (mod ~z$w_buff1_used~0_In509581333 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd0~0_In509581333 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite33_Out509581333| ~z$w_buff1~0_In509581333) .cse1) (and (= |ULTIMATE.start_main_#t~ite34_Out509581333| ~z$w_buff1~0_In509581333) (= |ULTIMATE.start_main_#t~ite33_In509581333| |ULTIMATE.start_main_#t~ite33_Out509581333|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In509581333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In509581333, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In509581333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In509581333, ~z$w_buff1~0=~z$w_buff1~0_In509581333, ~weak$$choice2~0=~weak$$choice2~0_In509581333, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In509581333|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In509581333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In509581333, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In509581333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In509581333, ~z$w_buff1~0=~z$w_buff1~0_In509581333, ~weak$$choice2~0=~weak$$choice2~0_In509581333, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out509581333|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out509581333|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 02:43:06,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:43:06,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1490548379 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1490548379| ~z$r_buff1_thd0~0_In1490548379) (= |ULTIMATE.start_main_#t~ite45_In1490548379| |ULTIMATE.start_main_#t~ite45_Out1490548379|) (not .cse0)) (and (= ~z$r_buff1_thd0~0_In1490548379 |ULTIMATE.start_main_#t~ite45_Out1490548379|) .cse0 (= |ULTIMATE.start_main_#t~ite46_Out1490548379| |ULTIMATE.start_main_#t~ite45_Out1490548379|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1490548379 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1490548379 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1490548379 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1490548379 256))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1490548379, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1490548379, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1490548379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1490548379, ~weak$$choice2~0=~weak$$choice2~0_In1490548379, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1490548379|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1490548379, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1490548379, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1490548379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1490548379, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1490548379|, ~weak$$choice2~0=~weak$$choice2~0_In1490548379, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1490548379|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:43:06,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:43:06,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:43:06,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:43:06 BasicIcfg [2019-12-27 02:43:06,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:43:06,580 INFO L168 Benchmark]: Toolchain (without parser) took 29847.41 ms. Allocated memory was 143.7 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.1 MB in the beginning and 829.6 MB in the end (delta: -726.5 MB). Peak memory consumption was 507.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,580 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 143.7 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:43:06,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.65 ms. Allocated memory was 143.7 MB in the beginning and 204.5 MB in the end (delta: 60.8 MB). Free memory was 102.7 MB in the beginning and 157.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,582 INFO L168 Benchmark]: Boogie Preprocessor took 48.85 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,583 INFO L168 Benchmark]: RCFGBuilder took 865.62 ms. Allocated memory is still 204.5 MB. Free memory was 152.0 MB in the beginning and 103.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,584 INFO L168 Benchmark]: TraceAbstraction took 28045.33 ms. Allocated memory was 204.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.0 MB in the beginning and 829.6 MB in the end (delta: -726.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:06,587 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.61 ms. Allocated memory is still 143.7 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.65 ms. Allocated memory was 143.7 MB in the beginning and 204.5 MB in the end (delta: 60.8 MB). Free memory was 102.7 MB in the beginning and 157.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.85 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.62 ms. Allocated memory is still 204.5 MB. Free memory was 152.0 MB in the beginning and 103.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28045.33 ms. Allocated memory was 204.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.0 MB in the beginning and 829.6 MB in the end (delta: -726.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1853 SDtfs, 1821 SDslu, 4844 SDs, 0 SdLazy, 2160 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 6.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 7250 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 789 ConstructedInterpolants, 0 QuantifiedInterpolants, 179294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...