/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:07:38,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:07:38,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:07:38,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:07:38,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:07:38,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:07:38,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:07:38,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:07:38,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:07:38,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:07:38,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:07:38,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:07:38,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:07:38,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:07:38,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:07:38,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:07:38,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:07:38,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:07:38,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:07:38,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:07:38,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:07:38,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:07:38,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:07:38,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:07:38,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:07:38,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:07:38,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:07:38,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:07:38,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:07:38,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:07:38,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:07:38,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:07:38,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:07:38,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:07:38,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:07:38,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:07:38,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:07:38,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:07:38,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:07:38,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:07:38,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:07:38,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:07:38,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:07:38,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:07:38,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:07:38,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:07:38,726 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:07:38,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:07:38,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:07:38,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:07:38,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:07:38,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:07:38,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:07:38,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:07:38,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:07:38,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:07:38,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:07:38,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:07:38,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:07:38,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:07:38,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:07:38,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:07:38,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:07:38,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:07:38,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:07:38,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:07:38,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:07:39,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:07:39,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:07:39,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:07:39,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:07:39,023 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:07:39,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-27 08:07:39,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc719ec0/01e42aec0e604b71a9468354cbea0bc5/FLAG554430eb2 [2019-12-27 08:07:39,683 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:07:39,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-27 08:07:39,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc719ec0/01e42aec0e604b71a9468354cbea0bc5/FLAG554430eb2 [2019-12-27 08:07:39,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc719ec0/01e42aec0e604b71a9468354cbea0bc5 [2019-12-27 08:07:39,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:07:39,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:07:39,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:39,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:07:39,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:07:39,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:39" (1/1) ... [2019-12-27 08:07:39,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:39, skipping insertion in model container [2019-12-27 08:07:39,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:39" (1/1) ... [2019-12-27 08:07:39,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:07:40,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:07:40,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:40,535 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:07:40,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:40,678 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:07:40,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40 WrapperNode [2019-12-27 08:07:40,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:40,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:40,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:07:40,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:07:40,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:40,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:07:40,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:07:40,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:07:40,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... [2019-12-27 08:07:40,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:07:40,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:07:40,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:07:40,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:07:40,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:07:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:07:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:07:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:07:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:07:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:07:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:07:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:07:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:07:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:07:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:07:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:07:40,861 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 08:07:41,584 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:07:41,584 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:07:41,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:41 BoogieIcfgContainer [2019-12-27 08:07:41,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:07:41,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:07:41,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:07:41,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:07:41,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:07:39" (1/3) ... [2019-12-27 08:07:41,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:41, skipping insertion in model container [2019-12-27 08:07:41,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:40" (2/3) ... [2019-12-27 08:07:41,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:41, skipping insertion in model container [2019-12-27 08:07:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:41" (3/3) ... [2019-12-27 08:07:41,600 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2019-12-27 08:07:41,610 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:07:41,611 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:07:41,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:07:41,626 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:07:41,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:41,724 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:07:41,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:07:41,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:07:41,750 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:07:41,750 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:07:41,750 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:07:41,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:07:41,750 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:07:41,751 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:07:41,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 08:07:41,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:41,893 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:41,893 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:41,908 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:41,925 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:41,967 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:41,968 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:41,972 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:41,985 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 08:07:41,986 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:07:44,999 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 08:07:45,110 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 08:07:45,134 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48808 [2019-12-27 08:07:45,134 INFO L214 etLargeBlockEncoding]: Total number of compositions: 95 [2019-12-27 08:07:45,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 08:07:45,584 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-27 08:07:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-27 08:07:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:07:45,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:45,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:07:45,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash 688178079, now seen corresponding path program 1 times [2019-12-27 08:07:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:45,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143245041] [2019-12-27 08:07:45,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:45,858 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 08:07:45,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143245041] [2019-12-27 08:07:45,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:45,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:07:45,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197600650] [2019-12-27 08:07:45,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:45,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:45,884 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-27 08:07:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:46,195 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-27 08:07:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:46,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:07:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:46,285 INFO L225 Difference]: With dead ends: 8560 [2019-12-27 08:07:46,285 INFO L226 Difference]: Without dead ends: 8391 [2019-12-27 08:07:46,287 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 08:07:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-27 08:07:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-27 08:07:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-27 08:07:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-27 08:07:46,678 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-27 08:07:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:46,678 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-27 08:07:46,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-27 08:07:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:46,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:46,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:46,682 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 530797982, now seen corresponding path program 1 times [2019-12-27 08:07:46,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:46,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471798565] [2019-12-27 08:07:46,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:46,811 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 08:07:46,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471798565] [2019-12-27 08:07:46,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:46,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:46,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829414887] [2019-12-27 08:07:46,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:46,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:46,816 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-27 08:07:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:47,354 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-27 08:07:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:47,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:47,425 INFO L225 Difference]: With dead ends: 13399 [2019-12-27 08:07:47,425 INFO L226 Difference]: Without dead ends: 13392 [2019-12-27 08:07:47,426 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 08:07:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-27 08:07:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 12075. [2019-12-27 08:07:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-12-27 08:07:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 38370 transitions. [2019-12-27 08:07:47,839 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 38370 transitions. Word has length 11 [2019-12-27 08:07:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:47,840 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 38370 transitions. [2019-12-27 08:07:47,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 38370 transitions. [2019-12-27 08:07:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:47,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:47,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:47,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1942568878, now seen corresponding path program 1 times [2019-12-27 08:07:47,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144045672] [2019-12-27 08:07:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:47,930 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 08:07:47,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144045672] [2019-12-27 08:07:47,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:47,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:47,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005067958] [2019-12-27 08:07:47,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:47,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:47,933 INFO L87 Difference]: Start difference. First operand 12075 states and 38370 transitions. Second operand 4 states. [2019-12-27 08:07:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:48,791 INFO L93 Difference]: Finished difference Result 15134 states and 47650 transitions. [2019-12-27 08:07:48,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:48,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:48,839 INFO L225 Difference]: With dead ends: 15134 [2019-12-27 08:07:48,840 INFO L226 Difference]: Without dead ends: 15134 [2019-12-27 08:07:48,840 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 08:07:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15134 states. [2019-12-27 08:07:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15134 to 13358. [2019-12-27 08:07:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13358 states. [2019-12-27 08:07:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13358 states to 13358 states and 42395 transitions. [2019-12-27 08:07:49,256 INFO L78 Accepts]: Start accepts. Automaton has 13358 states and 42395 transitions. Word has length 11 [2019-12-27 08:07:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,256 INFO L462 AbstractCegarLoop]: Abstraction has 13358 states and 42395 transitions. [2019-12-27 08:07:49,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 13358 states and 42395 transitions. [2019-12-27 08:07:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:07:49,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,261 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 08:07:49,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -608680593, now seen corresponding path program 1 times [2019-12-27 08:07:49,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663911952] [2019-12-27 08:07:49,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:49,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663911952] [2019-12-27 08:07:49,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:49,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:49,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310920314] [2019-12-27 08:07:49,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:49,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:49,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:49,433 INFO L87 Difference]: Start difference. First operand 13358 states and 42395 transitions. Second operand 4 states. [2019-12-27 08:07:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:49,474 INFO L93 Difference]: Finished difference Result 1973 states and 4569 transitions. [2019-12-27 08:07:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:07:49,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 08:07:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:49,481 INFO L225 Difference]: With dead ends: 1973 [2019-12-27 08:07:49,481 INFO L226 Difference]: Without dead ends: 1687 [2019-12-27 08:07:49,481 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 08:07:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-12-27 08:07:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1687. [2019-12-27 08:07:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-27 08:07:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 3778 transitions. [2019-12-27 08:07:49,512 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 3778 transitions. Word has length 17 [2019-12-27 08:07:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,512 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 3778 transitions. [2019-12-27 08:07:49,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 3778 transitions. [2019-12-27 08:07:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:07:49,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:49,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash 203458313, now seen corresponding path program 1 times [2019-12-27 08:07:49,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724362906] [2019-12-27 08:07:49,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:49,614 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 08:07:49,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724362906] [2019-12-27 08:07:49,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:49,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:07:49,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392874973] [2019-12-27 08:07:49,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:49,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:49,617 INFO L87 Difference]: Start difference. First operand 1687 states and 3778 transitions. Second operand 5 states. [2019-12-27 08:07:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:49,666 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-27 08:07:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:49,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 08:07:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:49,668 INFO L225 Difference]: With dead ends: 403 [2019-12-27 08:07:49,668 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 08:07:49,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:07:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 08:07:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 08:07:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 08:07:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-27 08:07:49,674 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-27 08:07:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,674 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-27 08:07:49,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-27 08:07:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:49,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:49,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1566289187, now seen corresponding path program 1 times [2019-12-27 08:07:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25910907] [2019-12-27 08:07:49,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:49,777 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 08:07:49,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25910907] [2019-12-27 08:07:49,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:49,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:49,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808144540] [2019-12-27 08:07:49,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:49,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:49,780 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-27 08:07:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:49,832 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-12-27 08:07:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:49,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 08:07:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:49,833 INFO L225 Difference]: With dead ends: 332 [2019-12-27 08:07:49,834 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 08:07:49,834 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 08:07:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 08:07:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 08:07:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 08:07:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-12-27 08:07:49,840 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-12-27 08:07:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,841 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-12-27 08:07:49,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-12-27 08:07:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:49,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:49,845 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1944342103, now seen corresponding path program 1 times [2019-12-27 08:07:49,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601206793] [2019-12-27 08:07:49,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:50,003 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 08:07:50,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601206793] [2019-12-27 08:07:50,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:50,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:50,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364909096] [2019-12-27 08:07:50,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:50,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:50,005 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 5 states. [2019-12-27 08:07:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:50,208 INFO L93 Difference]: Finished difference Result 459 states and 837 transitions. [2019-12-27 08:07:50,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:50,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 08:07:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:50,211 INFO L225 Difference]: With dead ends: 459 [2019-12-27 08:07:50,211 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 08:07:50,211 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 08:07:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 08:07:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 08:07:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 08:07:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 692 transitions. [2019-12-27 08:07:50,218 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 692 transitions. Word has length 52 [2019-12-27 08:07:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:50,218 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 692 transitions. [2019-12-27 08:07:50,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 692 transitions. [2019-12-27 08:07:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:50,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:50,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:50,220 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1307256259, now seen corresponding path program 2 times [2019-12-27 08:07:50,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:50,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524754748] [2019-12-27 08:07:50,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:50,316 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 08:07:50,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524754748] [2019-12-27 08:07:50,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:50,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:07:50,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584178668] [2019-12-27 08:07:50,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:50,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:50,320 INFO L87 Difference]: Start difference. First operand 375 states and 692 transitions. Second operand 6 states. [2019-12-27 08:07:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:50,656 INFO L93 Difference]: Finished difference Result 641 states and 1173 transitions. [2019-12-27 08:07:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:07:50,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 08:07:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:50,662 INFO L225 Difference]: With dead ends: 641 [2019-12-27 08:07:50,662 INFO L226 Difference]: Without dead ends: 641 [2019-12-27 08:07:50,662 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 08:07:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-12-27 08:07:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 405. [2019-12-27 08:07:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-27 08:07:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 752 transitions. [2019-12-27 08:07:50,668 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 752 transitions. Word has length 52 [2019-12-27 08:07:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:50,668 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 752 transitions. [2019-12-27 08:07:50,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 752 transitions. [2019-12-27 08:07:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:50,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:50,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:50,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash -438805035, now seen corresponding path program 3 times [2019-12-27 08:07:50,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:50,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598914140] [2019-12-27 08:07:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:50,729 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 08:07:50,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598914140] [2019-12-27 08:07:50,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:50,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:50,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983685823] [2019-12-27 08:07:50,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:50,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:50,732 INFO L87 Difference]: Start difference. First operand 405 states and 752 transitions. Second operand 3 states. [2019-12-27 08:07:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:50,744 INFO L93 Difference]: Finished difference Result 375 states and 677 transitions. [2019-12-27 08:07:50,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:50,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 08:07:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:50,745 INFO L225 Difference]: With dead ends: 375 [2019-12-27 08:07:50,745 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 08:07:50,746 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 08:07:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 08:07:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-27 08:07:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 08:07:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 655 transitions. [2019-12-27 08:07:50,752 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 655 transitions. Word has length 52 [2019-12-27 08:07:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:50,752 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 655 transitions. [2019-12-27 08:07:50,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 655 transitions. [2019-12-27 08:07:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 08:07:50,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:50,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:50,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1410277969, now seen corresponding path program 1 times [2019-12-27 08:07:50,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:50,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95320663] [2019-12-27 08:07:50,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:50,871 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 08:07:50,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95320663] [2019-12-27 08:07:50,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:50,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:50,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631811779] [2019-12-27 08:07:50,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:50,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:50,873 INFO L87 Difference]: Start difference. First operand 363 states and 655 transitions. Second operand 3 states. [2019-12-27 08:07:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:50,912 INFO L93 Difference]: Finished difference Result 362 states and 653 transitions. [2019-12-27 08:07:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:50,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 08:07:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:50,914 INFO L225 Difference]: With dead ends: 362 [2019-12-27 08:07:50,914 INFO L226 Difference]: Without dead ends: 362 [2019-12-27 08:07:50,915 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 08:07:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-27 08:07:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 273. [2019-12-27 08:07:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-27 08:07:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 492 transitions. [2019-12-27 08:07:50,920 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 492 transitions. Word has length 53 [2019-12-27 08:07:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:50,922 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 492 transitions. [2019-12-27 08:07:50,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 492 transitions. [2019-12-27 08:07:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:50,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:50,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:50,923 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1173138387, now seen corresponding path program 1 times [2019-12-27 08:07:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:50,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741392712] [2019-12-27 08:07:50,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:51,349 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 08:07:51,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741392712] [2019-12-27 08:07:51,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:51,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:07:51,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452419054] [2019-12-27 08:07:51,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:07:51,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:51,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:07:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:07:51,351 INFO L87 Difference]: Start difference. First operand 273 states and 492 transitions. Second operand 13 states. [2019-12-27 08:07:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,728 INFO L93 Difference]: Finished difference Result 549 states and 1002 transitions. [2019-12-27 08:07:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:07:51,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 08:07:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,731 INFO L225 Difference]: With dead ends: 549 [2019-12-27 08:07:51,732 INFO L226 Difference]: Without dead ends: 517 [2019-12-27 08:07:51,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:07:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-27 08:07:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 370. [2019-12-27 08:07:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-12-27 08:07:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 658 transitions. [2019-12-27 08:07:51,739 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 658 transitions. Word has length 54 [2019-12-27 08:07:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,739 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 658 transitions. [2019-12-27 08:07:51,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:07:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 658 transitions. [2019-12-27 08:07:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:51,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,741 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 817079345, now seen corresponding path program 2 times [2019-12-27 08:07:51,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927341448] [2019-12-27 08:07:51,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:51,857 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 08:07:51,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927341448] [2019-12-27 08:07:51,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:51,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:51,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731736159] [2019-12-27 08:07:51,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:51,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:51,859 INFO L87 Difference]: Start difference. First operand 370 states and 658 transitions. Second operand 6 states. [2019-12-27 08:07:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,927 INFO L93 Difference]: Finished difference Result 584 states and 1037 transitions. [2019-12-27 08:07:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:51,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 08:07:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,929 INFO L225 Difference]: With dead ends: 584 [2019-12-27 08:07:51,929 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 08:07:51,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:07:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 08:07:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-27 08:07:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 08:07:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 08:07:51,933 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-12-27 08:07:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,933 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 08:07:51,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 08:07:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:51,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,934 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1337955311, now seen corresponding path program 3 times [2019-12-27 08:07:51,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575682198] [2019-12-27 08:07:51,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:52,148 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 08:07:52,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575682198] [2019-12-27 08:07:52,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:52,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:07:52,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847617952] [2019-12-27 08:07:52,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:07:52,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:07:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:07:52,151 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 13 states. [2019-12-27 08:07:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:52,692 INFO L93 Difference]: Finished difference Result 375 states and 638 transitions. [2019-12-27 08:07:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:07:52,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 08:07:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:52,694 INFO L225 Difference]: With dead ends: 375 [2019-12-27 08:07:52,694 INFO L226 Difference]: Without dead ends: 343 [2019-12-27 08:07:52,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:07:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-27 08:07:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-27 08:07:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 08:07:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-27 08:07:52,700 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 54 [2019-12-27 08:07:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:52,700 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-27 08:07:52,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:07:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-27 08:07:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:52,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:52,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:52,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1670843661, now seen corresponding path program 4 times [2019-12-27 08:07:52,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:52,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328311051] [2019-12-27 08:07:52,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:53,268 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 08:07:53,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328311051] [2019-12-27 08:07:53,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:53,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 08:07:53,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789220371] [2019-12-27 08:07:53,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:07:53,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:07:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:07:53,270 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 19 states. [2019-12-27 08:07:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:54,176 INFO L93 Difference]: Finished difference Result 608 states and 1031 transitions. [2019-12-27 08:07:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 08:07:54,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-27 08:07:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:54,178 INFO L225 Difference]: With dead ends: 608 [2019-12-27 08:07:54,178 INFO L226 Difference]: Without dead ends: 576 [2019-12-27 08:07:54,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:07:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-27 08:07:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 319. [2019-12-27 08:07:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 08:07:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 555 transitions. [2019-12-27 08:07:54,186 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 555 transitions. Word has length 54 [2019-12-27 08:07:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:54,187 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 555 transitions. [2019-12-27 08:07:54,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:07:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 555 transitions. [2019-12-27 08:07:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:54,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:54,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:54,189 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1036230157, now seen corresponding path program 5 times [2019-12-27 08:07:54,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:54,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569865798] [2019-12-27 08:07:54,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:54,655 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 08:07:54,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569865798] [2019-12-27 08:07:54,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:54,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 08:07:54,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718822009] [2019-12-27 08:07:54,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:07:54,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:54,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:07:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:07:54,657 INFO L87 Difference]: Start difference. First operand 319 states and 555 transitions. Second operand 18 states. [2019-12-27 08:07:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:55,788 INFO L93 Difference]: Finished difference Result 593 states and 1010 transitions. [2019-12-27 08:07:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:07:55,788 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 08:07:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:55,790 INFO L225 Difference]: With dead ends: 593 [2019-12-27 08:07:55,790 INFO L226 Difference]: Without dead ends: 561 [2019-12-27 08:07:55,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:07:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-12-27 08:07:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 326. [2019-12-27 08:07:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-27 08:07:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 568 transitions. [2019-12-27 08:07:55,798 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 568 transitions. Word has length 54 [2019-12-27 08:07:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:55,798 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 568 transitions. [2019-12-27 08:07:55,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:07:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 568 transitions. [2019-12-27 08:07:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:55,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:55,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:55,800 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -422132919, now seen corresponding path program 6 times [2019-12-27 08:07:55,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:55,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528748560] [2019-12-27 08:07:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:56,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528748560] [2019-12-27 08:07:56,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:56,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 08:07:56,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016049668] [2019-12-27 08:07:56,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:07:56,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:07:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:07:56,363 INFO L87 Difference]: Start difference. First operand 326 states and 568 transitions. Second operand 18 states. [2019-12-27 08:07:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:57,491 INFO L93 Difference]: Finished difference Result 589 states and 1003 transitions. [2019-12-27 08:07:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:07:57,491 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 08:07:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:57,493 INFO L225 Difference]: With dead ends: 589 [2019-12-27 08:07:57,494 INFO L226 Difference]: Without dead ends: 557 [2019-12-27 08:07:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:07:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-12-27 08:07:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 327. [2019-12-27 08:07:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 08:07:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 570 transitions. [2019-12-27 08:07:57,502 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 570 transitions. Word has length 54 [2019-12-27 08:07:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:57,503 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 570 transitions. [2019-12-27 08:07:57,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:07:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 570 transitions. [2019-12-27 08:07:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:57,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:57,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:57,508 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1370214765, now seen corresponding path program 7 times [2019-12-27 08:07:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796215686] [2019-12-27 08:07:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:58,026 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 08:07:58,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796215686] [2019-12-27 08:07:58,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:58,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 08:07:58,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297145225] [2019-12-27 08:07:58,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:07:58,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:07:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:07:58,030 INFO L87 Difference]: Start difference. First operand 327 states and 570 transitions. Second operand 18 states. [2019-12-27 08:07:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:59,368 INFO L93 Difference]: Finished difference Result 799 states and 1348 transitions. [2019-12-27 08:07:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:07:59,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 08:07:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:59,371 INFO L225 Difference]: With dead ends: 799 [2019-12-27 08:07:59,371 INFO L226 Difference]: Without dead ends: 767 [2019-12-27 08:07:59,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:07:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-12-27 08:07:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 333. [2019-12-27 08:07:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 08:07:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 581 transitions. [2019-12-27 08:07:59,377 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 581 transitions. Word has length 54 [2019-12-27 08:07:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:59,378 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 581 transitions. [2019-12-27 08:07:59,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:07:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 581 transitions. [2019-12-27 08:07:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:59,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:59,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:59,379 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash 57952661, now seen corresponding path program 8 times [2019-12-27 08:07:59,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:59,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169908471] [2019-12-27 08:07:59,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:59,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:07:59,475 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:07:59,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2483~0.base_19| 4)) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_15 0) (= v_~x$flush_delayed~0_15 0) (= v_~x~0_28 0) (= 0 v_~__unbuffered_cnt~0_13) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19| 1)) (= 0 |v_ULTIMATE.start_main_~#t2483~0.offset_16|) (= 0 v_~x$w_buff0_used~0_107) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (= 0 v_~x$r_buff0_thd1~0_18) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19|)) (= 0 v_~weak$$choice2~0_36) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19|) |v_ULTIMATE.start_main_~#t2483~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2483~0.base_19|) (= 0 v_~x$r_buff0_thd2~0_23) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_46 0) (= |v_#NULL.offset_5| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~x$w_buff0~0_29) (= v_~x$r_buff1_thd1~0_17 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_16|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_16|, ULTIMATE.start_main_~#t2483~0.base=|v_ULTIMATE.start_main_~#t2483~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_20|, ULTIMATE.start_main_~#t2483~0.offset=|v_ULTIMATE.start_main_~#t2483~0.offset_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_18, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_14|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_13|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2484~0.offset, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t2483~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2483~0.offset, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:07:59,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L777-1-->L779: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2484~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2484~0.offset_9|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2484~0.base_10|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10|) |v_ULTIMATE.start_main_~#t2484~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_10|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2484~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 08:07:59,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] P1ENTRY-->L4-3: Formula: (and (= (mod ~x$w_buff1_used~0_Out-750256963 256) 0) (= ~x$w_buff0_used~0_In-750256963 ~x$w_buff1_used~0_Out-750256963) (= P1Thread1of1ForFork1_~arg.base_Out-750256963 |P1Thread1of1ForFork1_#in~arg.base_In-750256963|) (= |P1Thread1of1ForFork1_#in~arg.offset_In-750256963| P1Thread1of1ForFork1_~arg.offset_Out-750256963) (= ~x$w_buff1~0_Out-750256963 ~x$w_buff0~0_In-750256963) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-750256963| 1) (= ~x$w_buff0~0_Out-750256963 2) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-750256963 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-750256963|) (= ~x$w_buff0_used~0_Out-750256963 1)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-750256963, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-750256963|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-750256963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-750256963} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-750256963, ~x$w_buff0~0=~x$w_buff0~0_Out-750256963, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-750256963, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-750256963|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-750256963, ~x$w_buff1~0=~x$w_buff1~0_Out-750256963, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-750256963|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-750256963|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-750256963, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-750256963} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 08:07:59,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out214800990| |P0Thread1of1ForFork0_#t~ite3_Out214800990|)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In214800990 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In214800990 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out214800990| ~x~0_In214800990) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out214800990| ~x$w_buff1~0_In214800990)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In214800990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214800990, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In214800990, ~x~0=~x~0_In214800990} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out214800990|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out214800990|, ~x$w_buff1~0=~x$w_buff1~0_In214800990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214800990, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In214800990, ~x~0=~x~0_In214800990} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 08:07:59,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-517520948 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-517520948 256) 0))) (or (and (= ~x$w_buff0_used~0_In-517520948 |P1Thread1of1ForFork1_#t~ite11_Out-517520948|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-517520948|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-517520948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517520948} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-517520948|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-517520948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517520948} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 08:07:59,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In498128541 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In498128541 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out498128541| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out498128541| ~x$w_buff0_used~0_In498128541) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In498128541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498128541} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out498128541|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In498128541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498128541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 08:07:59,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-240668617 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-240668617 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-240668617 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-240668617 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-240668617|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-240668617 |P0Thread1of1ForFork0_#t~ite6_Out-240668617|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-240668617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-240668617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-240668617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-240668617} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-240668617|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-240668617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-240668617, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-240668617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-240668617} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 08:07:59,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603231943 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1603231943 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1603231943| ~x$r_buff0_thd1~0_In-1603231943)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1603231943| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603231943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603231943} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603231943, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1603231943|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603231943} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 08:07:59,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In735408909 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In735408909 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In735408909 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In735408909 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In735408909 |P0Thread1of1ForFork0_#t~ite8_Out735408909|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out735408909|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In735408909, ~x$w_buff1_used~0=~x$w_buff1_used~0_In735408909, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In735408909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735408909} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In735408909, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out735408909|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In735408909, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In735408909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735408909} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 08:07:59,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 08:07:59,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In199146378 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In199146378 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In199146378 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In199146378 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out199146378|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In199146378 |P1Thread1of1ForFork1_#t~ite12_Out199146378|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In199146378, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In199146378, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In199146378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In199146378} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In199146378, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In199146378, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out199146378|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In199146378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In199146378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 08:07:59,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1955731239 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1955731239 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1955731239 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1955731239 ~x$r_buff0_thd2~0_Out1955731239)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1955731239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1955731239} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1955731239|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1955731239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1955731239} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:07:59,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-920799879 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-920799879 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-920799879 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-920799879 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-920799879|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-920799879| ~x$r_buff1_thd2~0_In-920799879)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-920799879, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-920799879, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-920799879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-920799879} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-920799879, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-920799879, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-920799879, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-920799879|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-920799879} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:07:59,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L758-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 08:07:59,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$r_buff0_thd0~0_47 256) 0) (= (mod v_~x$w_buff0_used~0_70 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 08:07:59,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In65197538 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In65197538 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In65197538 |ULTIMATE.start_main_#t~ite17_Out65197538|)) (and (or .cse1 .cse0) (= ~x~0_In65197538 |ULTIMATE.start_main_#t~ite17_Out65197538|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In65197538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65197538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65197538, ~x~0=~x~0_In65197538} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out65197538|, ~x$w_buff1~0=~x$w_buff1~0_In65197538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65197538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65197538, ~x~0=~x~0_In65197538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 08:07:59,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 08:07:59,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1162149510 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1162149510 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1162149510 |ULTIMATE.start_main_#t~ite19_Out-1162149510|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1162149510|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1162149510, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1162149510} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1162149510, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1162149510|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1162149510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 08:07:59,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-586747602 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-586747602 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-586747602 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-586747602 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-586747602 |ULTIMATE.start_main_#t~ite20_Out-586747602|)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-586747602|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-586747602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-586747602, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-586747602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586747602} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-586747602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-586747602, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-586747602|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-586747602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586747602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 08:07:59,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1408910594 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1408910594 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1408910594| ~x$r_buff0_thd0~0_In1408910594) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1408910594|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1408910594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408910594} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1408910594, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1408910594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408910594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 08:07:59,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1960925397 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1960925397 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1960925397 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1960925397 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1960925397| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1960925397| ~x$r_buff1_thd0~0_In-1960925397)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960925397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1960925397, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1960925397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960925397} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960925397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1960925397, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1960925397, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1960925397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960925397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 08:07:59,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse4 (= (mod ~x$r_buff1_thd0~0_In-1884319793 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In-1884319793 256))) (.cse5 (= (mod ~x$w_buff1_used~0_In-1884319793 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1884319793 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite38_Out-1884319793| |ULTIMATE.start_main_#t~ite37_Out-1884319793|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1884319793 256)))) (or (let ((.cse3 (not .cse6))) (and .cse0 (not .cse1) .cse2 (or .cse3 (not .cse4)) (= |ULTIMATE.start_main_#t~ite36_Out-1884319793| |ULTIMATE.start_main_#t~ite37_Out-1884319793|) (or .cse3 (not .cse5)) (= |ULTIMATE.start_main_#t~ite36_Out-1884319793| 0))) (and (= |ULTIMATE.start_main_#t~ite36_In-1884319793| |ULTIMATE.start_main_#t~ite36_Out-1884319793|) (or (and .cse0 (or (and .cse6 .cse4) (and .cse6 .cse5) .cse1) .cse2 (= ~x$w_buff1_used~0_In-1884319793 |ULTIMATE.start_main_#t~ite37_Out-1884319793|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In-1884319793| |ULTIMATE.start_main_#t~ite37_Out-1884319793|) (= ~x$w_buff1_used~0_In-1884319793 |ULTIMATE.start_main_#t~ite38_Out-1884319793|)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1884319793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1884319793, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1884319793|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1884319793|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1884319793, ~weak$$choice2~0=~weak$$choice2~0_In-1884319793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884319793} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1884319793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1884319793, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1884319793|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1884319793|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1884319793|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1884319793, ~weak$$choice2~0=~weak$$choice2~0_In-1884319793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884319793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:07:59,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd0~0_51 v_~x$r_buff0_thd0~0_50)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 08:07:59,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L804-->L4: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:07:59,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 08:07:59,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:07:59 BasicIcfg [2019-12-27 08:07:59,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:07:59,556 INFO L168 Benchmark]: Toolchain (without parser) took 19593.89 ms. Allocated memory was 144.7 MB in the beginning and 686.3 MB in the end (delta: 541.6 MB). Free memory was 99.9 MB in the beginning and 404.9 MB in the end (delta: -305.0 MB). Peak memory consumption was 236.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,557 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.05 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 157.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,559 INFO L168 Benchmark]: Boogie Preprocessor took 37.09 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,559 INFO L168 Benchmark]: RCFGBuilder took 798.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 107.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,560 INFO L168 Benchmark]: TraceAbstraction took 17964.89 ms. Allocated memory was 202.9 MB in the beginning and 686.3 MB in the end (delta: 483.4 MB). Free memory was 107.5 MB in the beginning and 404.9 MB in the end (delta: -297.4 MB). Peak memory consumption was 186.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:59,564 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.53 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.05 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 157.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.09 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 107.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17964.89 ms. Allocated memory was 202.9 MB in the beginning and 686.3 MB in the end (delta: 483.4 MB). Free memory was 107.5 MB in the beginning and 404.9 MB in the end (delta: -297.4 MB). Peak memory consumption was 186.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 26 ChoiceCompositions, 3565 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48808 CheckedPairsTotal, 95 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1738 SDtfs, 1855 SDslu, 6120 SDs, 0 SdLazy, 5044 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 21 SyntacticMatches, 20 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13358occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 4914 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 178283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...