/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:12:56,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:12:56,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:12:56,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:12:56,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:12:56,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:12:56,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:12:56,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:12:56,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:12:56,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:12:56,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:12:56,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:12:56,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:12:56,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:12:56,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:12:56,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:12:56,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:12:56,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:12:56,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:12:56,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:12:56,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:12:56,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:12:56,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:12:56,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:12:56,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:12:56,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:12:56,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:12:56,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:12:56,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:12:56,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:12:56,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:12:56,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:12:56,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:12:56,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:12:56,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:12:56,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:12:56,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:12:56,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:12:56,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:12:56,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:12:56,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:12:56,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:12:56,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:12:56,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:12:56,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:12:56,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:12:56,747 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:12:56,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:12:56,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:12:56,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:12:56,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:12:56,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:12:56,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:12:56,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:12:56,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:12:56,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:12:56,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:12:56,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:12:56,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:12:56,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:12:56,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:12:56,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:12:56,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:12:56,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:56,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:12:56,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:12:56,752 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:12:56,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:12:57,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:12:57,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:12:57,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:12:57,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:12:57,058 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:12:57,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 18:12:57,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cfd4760/8022e195fa2f47908a2b1378b5d17a0b/FLAG6ca8cbfb5 [2019-12-27 18:12:57,709 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:12:57,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 18:12:57,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cfd4760/8022e195fa2f47908a2b1378b5d17a0b/FLAG6ca8cbfb5 [2019-12-27 18:12:58,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cfd4760/8022e195fa2f47908a2b1378b5d17a0b [2019-12-27 18:12:58,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:12:58,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:12:58,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:58,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:12:58,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:12:58,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a7d1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58, skipping insertion in model container [2019-12-27 18:12:58,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:12:58,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:12:58,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:58,623 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:12:58,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:58,780 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:12:58,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58 WrapperNode [2019-12-27 18:12:58,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:58,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:58,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:12:58,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:12:58,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:58,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:12:58,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:12:58,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:12:58,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (1/1) ... [2019-12-27 18:12:58,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:12:58,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:12:58,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:12:58,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:12:58,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (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 18:12:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:12:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:12:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:12:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:12:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:12:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:12:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:12:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:12:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:12:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:12:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:12:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:12:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:12:58,965 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 18:12:59,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:12:59,714 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:12:59,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:59 BoogieIcfgContainer [2019-12-27 18:12:59,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:12:59,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:12:59,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:12:59,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:12:59,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:12:58" (1/3) ... [2019-12-27 18:12:59,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6129ebcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:59, skipping insertion in model container [2019-12-27 18:12:59,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:58" (2/3) ... [2019-12-27 18:12:59,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6129ebcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:59, skipping insertion in model container [2019-12-27 18:12:59,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:59" (3/3) ... [2019-12-27 18:12:59,724 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2019-12-27 18:12:59,735 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:12:59,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:12:59,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:12:59,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:12:59,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,803 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,803 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:12:59,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:12:59,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:12:59,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:12:59,938 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:12:59,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:12:59,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:12:59,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:12:59,938 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:12:59,955 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 18:12:59,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:00,065 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:00,066 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:00,083 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:00,110 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:00,170 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:00,170 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:00,178 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:00,200 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 18:13:00,201 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:13:05,333 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:13:05,440 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:13:05,491 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87419 [2019-12-27 18:13:05,491 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 18:13:05,495 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 18:13:22,600 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 18:13:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 18:13:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:13:22,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:22,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:13:22,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 809706692, now seen corresponding path program 1 times [2019-12-27 18:13:22,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88991972] [2019-12-27 18:13:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:22,883 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 18:13:22,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88991972] [2019-12-27 18:13:22,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:22,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:13:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732514559] [2019-12-27 18:13:22,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:22,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:22,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:13:22,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:22,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:22,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:13:22,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:13:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:22,925 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 18:13:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:26,678 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 18:13:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:13:26,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:13:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:27,416 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 18:13:27,416 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 18:13:27,418 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 18:13:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 18:13:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 18:13:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 18:13:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 18:13:38,061 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 18:13:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:38,062 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 18:13:38,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:13:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 18:13:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:13:38,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:38,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:38,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1056800905, now seen corresponding path program 1 times [2019-12-27 18:13:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:38,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616266520] [2019-12-27 18:13:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:38,153 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 18:13:38,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616266520] [2019-12-27 18:13:38,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:38,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:38,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207178740] [2019-12-27 18:13:38,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:38,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:38,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 18:13:38,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:38,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:13:38,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:13:38,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:13:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:13:38,201 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 5 states. [2019-12-27 18:13:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:43,789 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 18:13:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:43,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 18:13:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:44,523 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 18:13:44,523 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 18:13:44,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:13:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 18:13:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 18:13:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 18:13:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 18:13:53,122 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 18:13:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:53,123 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 18:13:53,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:13:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 18:13:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:13:53,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:53,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:53,131 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 933289536, now seen corresponding path program 1 times [2019-12-27 18:13:53,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:53,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432033378] [2019-12-27 18:13:53,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:53,218 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 18:13:53,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432033378] [2019-12-27 18:13:53,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:53,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062388316] [2019-12-27 18:13:53,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:53,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:53,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:13:53,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:53,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:53,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:13:53,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:13:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:13:53,224 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 18:13:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:59,590 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 18:13:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:59,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:13:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:00,894 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 18:14:00,895 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 18:14:00,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 18:14:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 18:14:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 18:14:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 18:14:20,649 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 18:14:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:20,651 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 18:14:20,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 18:14:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:14:20,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:20,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:20,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1797085387, now seen corresponding path program 1 times [2019-12-27 18:14:20,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:20,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489675271] [2019-12-27 18:14:20,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:20,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489675271] [2019-12-27 18:14:20,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:20,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:20,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227507972] [2019-12-27 18:14:20,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:20,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:20,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:14:20,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:20,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:20,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:20,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:20,746 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 18:14:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:20,927 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 18:14:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:20,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:14:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:20,986 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 18:14:20,987 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 18:14:20,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 18:14:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 18:14:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 18:14:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 18:14:21,671 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 18:14:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:21,671 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 18:14:21,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 18:14:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:14:21,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:21,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:21,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1117796869, now seen corresponding path program 1 times [2019-12-27 18:14:21,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:21,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248342207] [2019-12-27 18:14:21,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:21,752 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 18:14:21,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248342207] [2019-12-27 18:14:21,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:21,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:21,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586761232] [2019-12-27 18:14:21,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:21,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:21,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 57 transitions. [2019-12-27 18:14:21,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:21,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:21,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:21,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:21,777 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 6 states. [2019-12-27 18:14:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:22,869 INFO L93 Difference]: Finished difference Result 58249 states and 186844 transitions. [2019-12-27 18:14:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:14:22,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 18:14:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:22,960 INFO L225 Difference]: With dead ends: 58249 [2019-12-27 18:14:22,960 INFO L226 Difference]: Without dead ends: 58236 [2019-12-27 18:14:22,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58236 states. [2019-12-27 18:14:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58236 to 37328. [2019-12-27 18:14:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 18:14:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 18:14:25,409 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 18:14:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:25,410 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 18:14:25,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 18:14:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:14:25,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:25,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:25,423 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 7812214, now seen corresponding path program 1 times [2019-12-27 18:14:25,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:25,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733219381] [2019-12-27 18:14:25,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:25,496 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 18:14:25,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733219381] [2019-12-27 18:14:25,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:25,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:25,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911114642] [2019-12-27 18:14:25,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:25,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:25,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 18:14:25,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:25,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:25,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:25,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:25,562 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 6 states. [2019-12-27 18:14:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:25,611 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 18:14:25,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:14:25,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:14:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:25,622 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 18:14:25,622 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 18:14:25,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 18:14:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 18:14:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 18:14:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 18:14:25,733 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 18:14:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:25,735 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 18:14:25,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 18:14:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:14:25,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:25,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:25,746 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1437682904, now seen corresponding path program 1 times [2019-12-27 18:14:25,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:25,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629928912] [2019-12-27 18:14:25,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:25,846 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 18:14:25,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629928912] [2019-12-27 18:14:25,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:25,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:25,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353264584] [2019-12-27 18:14:25,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:25,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:25,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 103 transitions. [2019-12-27 18:14:25,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:25,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:25,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:25,883 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 18:14:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:25,933 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 18:14:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:25,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:14:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:25,940 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 18:14:25,940 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 18:14:25,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 18:14:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 18:14:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 18:14:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 18:14:26,010 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 18:14:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 18:14:26,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 18:14:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:26,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:26,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:26,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:26,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2059462380, now seen corresponding path program 1 times [2019-12-27 18:14:26,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:26,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070249211] [2019-12-27 18:14:26,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:26,106 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 18:14:26,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070249211] [2019-12-27 18:14:26,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:26,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:26,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841731125] [2019-12-27 18:14:26,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:26,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:27,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:27,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:27,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:27,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:27,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:27,867 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 18:14:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:27,922 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 18:14:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:27,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:27,930 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:14:27,931 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:14:27,931 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 18:14:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:14:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:14:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:14:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 18:14:27,992 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 18:14:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:27,992 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 18:14:27,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 18:14:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:27,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:27,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:27,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:27,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash -151073877, now seen corresponding path program 1 times [2019-12-27 18:14:28,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:28,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245380021] [2019-12-27 18:14:28,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:28,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245380021] [2019-12-27 18:14:28,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:28,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:28,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32152910] [2019-12-27 18:14:28,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:28,106 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:28,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:28,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:28,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:28,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:28,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:28,251 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 18:14:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:28,306 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 18:14:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:28,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:28,314 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:14:28,315 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:14:28,315 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 18:14:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:14:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:14:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:14:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 18:14:28,379 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 18:14:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:28,379 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 18:14:28,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 18:14:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:28,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:28,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:28,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -160756913, now seen corresponding path program 1 times [2019-12-27 18:14:28,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:28,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686860547] [2019-12-27 18:14:28,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:28,518 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 18:14:28,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686860547] [2019-12-27 18:14:28,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:28,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:28,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618169565] [2019-12-27 18:14:28,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:28,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:28,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:28,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:28,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:28,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:28,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:28,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:28,708 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-27 18:14:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:29,122 INFO L93 Difference]: Finished difference Result 7415 states and 21062 transitions. [2019-12-27 18:14:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:29,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 18:14:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:29,135 INFO L225 Difference]: With dead ends: 7415 [2019-12-27 18:14:29,136 INFO L226 Difference]: Without dead ends: 7415 [2019-12-27 18:14:29,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:14:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-12-27 18:14:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 5421. [2019-12-27 18:14:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-27 18:14:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-27 18:14:29,271 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-27 18:14:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:29,271 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-27 18:14:29,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-27 18:14:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:29,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:29,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:29,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 947021199, now seen corresponding path program 2 times [2019-12-27 18:14:29,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:29,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833458613] [2019-12-27 18:14:29,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:29,372 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 18:14:29,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833458613] [2019-12-27 18:14:29,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:29,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:29,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [376711576] [2019-12-27 18:14:29,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:29,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:29,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 248 transitions. [2019-12-27 18:14:29,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:29,628 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-12-27 18:14:29,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:14:29,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:14:29,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:29,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:14:29,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:14:29,647 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 8 states. [2019-12-27 18:14:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:30,836 INFO L93 Difference]: Finished difference Result 12278 states and 35556 transitions. [2019-12-27 18:14:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:14:30,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 18:14:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:30,852 INFO L225 Difference]: With dead ends: 12278 [2019-12-27 18:14:30,852 INFO L226 Difference]: Without dead ends: 12278 [2019-12-27 18:14:30,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:14:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2019-12-27 18:14:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 5935. [2019-12-27 18:14:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5935 states. [2019-12-27 18:14:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 17205 transitions. [2019-12-27 18:14:30,973 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 17205 transitions. Word has length 65 [2019-12-27 18:14:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:30,974 INFO L462 AbstractCegarLoop]: Abstraction has 5935 states and 17205 transitions. [2019-12-27 18:14:30,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:14:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 17205 transitions. [2019-12-27 18:14:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:30,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:30,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:30,982 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1073447055, now seen corresponding path program 3 times [2019-12-27 18:14:30,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:30,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40873649] [2019-12-27 18:14:30,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:31,060 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 18:14:31,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40873649] [2019-12-27 18:14:31,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:31,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:31,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290701156] [2019-12-27 18:14:31,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:31,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:31,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 398 transitions. [2019-12-27 18:14:31,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:31,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:31,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:31,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:31,220 INFO L87 Difference]: Start difference. First operand 5935 states and 17205 transitions. Second operand 3 states. [2019-12-27 18:14:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:31,269 INFO L93 Difference]: Finished difference Result 5113 states and 14532 transitions. [2019-12-27 18:14:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:31,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:31,277 INFO L225 Difference]: With dead ends: 5113 [2019-12-27 18:14:31,277 INFO L226 Difference]: Without dead ends: 5113 [2019-12-27 18:14:31,278 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 18:14:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2019-12-27 18:14:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4949. [2019-12-27 18:14:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 18:14:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-27 18:14:31,355 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 65 [2019-12-27 18:14:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:31,355 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-27 18:14:31,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-27 18:14:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:31,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:31,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:31,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:31,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash -924926265, now seen corresponding path program 1 times [2019-12-27 18:14:31,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:31,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899661974] [2019-12-27 18:14:31,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:31,456 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 18:14:31,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899661974] [2019-12-27 18:14:31,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:31,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:31,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190519870] [2019-12-27 18:14:31,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:31,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:31,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 238 transitions. [2019-12-27 18:14:31,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:31,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:14:31,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:31,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:31,608 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 5 states. [2019-12-27 18:14:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:31,857 INFO L93 Difference]: Finished difference Result 7463 states and 21088 transitions. [2019-12-27 18:14:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:31,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:14:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:31,867 INFO L225 Difference]: With dead ends: 7463 [2019-12-27 18:14:31,867 INFO L226 Difference]: Without dead ends: 7463 [2019-12-27 18:14:31,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 6 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 18:14:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-12-27 18:14:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6154. [2019-12-27 18:14:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-12-27 18:14:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 17545 transitions. [2019-12-27 18:14:32,031 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 17545 transitions. Word has length 66 [2019-12-27 18:14:32,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:32,031 INFO L462 AbstractCegarLoop]: Abstraction has 6154 states and 17545 transitions. [2019-12-27 18:14:32,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 17545 transitions. [2019-12-27 18:14:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:32,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:32,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:32,043 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1368765211, now seen corresponding path program 2 times [2019-12-27 18:14:32,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:32,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034479173] [2019-12-27 18:14:32,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:32,335 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 18:14:32,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034479173] [2019-12-27 18:14:32,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:32,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:14:32,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378837485] [2019-12-27 18:14:32,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:32,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:32,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 273 transitions. [2019-12-27 18:14:32,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:32,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:14:32,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:14:32,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:14:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:14:32,507 INFO L87 Difference]: Start difference. First operand 6154 states and 17545 transitions. Second operand 9 states. [2019-12-27 18:14:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:33,557 INFO L93 Difference]: Finished difference Result 8873 states and 24903 transitions. [2019-12-27 18:14:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 18:14:33,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 18:14:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:33,570 INFO L225 Difference]: With dead ends: 8873 [2019-12-27 18:14:33,571 INFO L226 Difference]: Without dead ends: 8873 [2019-12-27 18:14:33,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:14:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-12-27 18:14:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6441. [2019-12-27 18:14:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2019-12-27 18:14:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 18335 transitions. [2019-12-27 18:14:33,674 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 18335 transitions. Word has length 66 [2019-12-27 18:14:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:33,674 INFO L462 AbstractCegarLoop]: Abstraction has 6441 states and 18335 transitions. [2019-12-27 18:14:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:14:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 18335 transitions. [2019-12-27 18:14:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:33,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:33,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:33,683 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:33,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1762090943, now seen corresponding path program 3 times [2019-12-27 18:14:33,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:33,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126943144] [2019-12-27 18:14:33,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:33,893 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 18:14:33,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126943144] [2019-12-27 18:14:33,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:33,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:14:33,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373563598] [2019-12-27 18:14:33,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:33,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:34,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 274 transitions. [2019-12-27 18:14:34,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:34,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:14:34,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:14:34,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:14:34,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:34,286 INFO L87 Difference]: Start difference. First operand 6441 states and 18335 transitions. Second operand 11 states. [2019-12-27 18:14:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:36,152 INFO L93 Difference]: Finished difference Result 15693 states and 43368 transitions. [2019-12-27 18:14:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 18:14:36,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 18:14:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:36,177 INFO L225 Difference]: With dead ends: 15693 [2019-12-27 18:14:36,178 INFO L226 Difference]: Without dead ends: 15693 [2019-12-27 18:14:36,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:14:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15693 states. [2019-12-27 18:14:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15693 to 6579. [2019-12-27 18:14:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 18:14:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 18678 transitions. [2019-12-27 18:14:36,484 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 18678 transitions. Word has length 66 [2019-12-27 18:14:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:36,485 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 18678 transitions. [2019-12-27 18:14:36,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:14:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 18678 transitions. [2019-12-27 18:14:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:36,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:36,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:36,501 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1098709733, now seen corresponding path program 4 times [2019-12-27 18:14:36,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:36,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721000324] [2019-12-27 18:14:36,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:36,576 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 18:14:36,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721000324] [2019-12-27 18:14:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876660526] [2019-12-27 18:14:36,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:36,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:36,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 236 transitions. [2019-12-27 18:14:36,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:36,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:36,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:36,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:36,726 INFO L87 Difference]: Start difference. First operand 6579 states and 18678 transitions. Second operand 3 states. [2019-12-27 18:14:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:36,799 INFO L93 Difference]: Finished difference Result 6579 states and 18677 transitions. [2019-12-27 18:14:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:36,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 18:14:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:36,811 INFO L225 Difference]: With dead ends: 6579 [2019-12-27 18:14:36,811 INFO L226 Difference]: Without dead ends: 6579 [2019-12-27 18:14:36,811 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 18:14:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2019-12-27 18:14:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 3938. [2019-12-27 18:14:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3938 states. [2019-12-27 18:14:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 11268 transitions. [2019-12-27 18:14:36,940 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 11268 transitions. Word has length 66 [2019-12-27 18:14:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:36,941 INFO L462 AbstractCegarLoop]: Abstraction has 3938 states and 11268 transitions. [2019-12-27 18:14:36,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 11268 transitions. [2019-12-27 18:14:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:36,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:36,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:36,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1906146231, now seen corresponding path program 1 times [2019-12-27 18:14:36,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:36,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392924835] [2019-12-27 18:14:36,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:37,031 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 18:14:37,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392924835] [2019-12-27 18:14:37,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:37,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:37,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4028859] [2019-12-27 18:14:37,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:37,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:37,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 255 transitions. [2019-12-27 18:14:37,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:37,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:37,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:37,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:37,183 INFO L87 Difference]: Start difference. First operand 3938 states and 11268 transitions. Second operand 3 states. [2019-12-27 18:14:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:37,208 INFO L93 Difference]: Finished difference Result 3702 states and 10410 transitions. [2019-12-27 18:14:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:37,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:14:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:37,214 INFO L225 Difference]: With dead ends: 3702 [2019-12-27 18:14:37,214 INFO L226 Difference]: Without dead ends: 3702 [2019-12-27 18:14:37,215 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 18:14:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-12-27 18:14:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3262. [2019-12-27 18:14:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-12-27 18:14:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 9150 transitions. [2019-12-27 18:14:37,287 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 9150 transitions. Word has length 67 [2019-12-27 18:14:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:37,288 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 9150 transitions. [2019-12-27 18:14:37,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 9150 transitions. [2019-12-27 18:14:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:37,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:37,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:37,293 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1921941603, now seen corresponding path program 1 times [2019-12-27 18:14:37,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:37,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920725321] [2019-12-27 18:14:37,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:37,414 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 18:14:37,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920725321] [2019-12-27 18:14:37,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:37,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:37,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671774178] [2019-12-27 18:14:37,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:37,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:37,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 297 transitions. [2019-12-27 18:14:37,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:37,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:14:37,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:14:37,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:14:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:37,597 INFO L87 Difference]: Start difference. First operand 3262 states and 9150 transitions. Second operand 7 states. [2019-12-27 18:14:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:37,902 INFO L93 Difference]: Finished difference Result 7073 states and 19868 transitions. [2019-12-27 18:14:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:14:37,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 18:14:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:37,909 INFO L225 Difference]: With dead ends: 7073 [2019-12-27 18:14:37,909 INFO L226 Difference]: Without dead ends: 3823 [2019-12-27 18:14:37,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2019-12-27 18:14:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 2695. [2019-12-27 18:14:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-27 18:14:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 7503 transitions. [2019-12-27 18:14:37,954 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 7503 transitions. Word has length 68 [2019-12-27 18:14:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:37,954 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 7503 transitions. [2019-12-27 18:14:37,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:14:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 7503 transitions. [2019-12-27 18:14:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:37,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:37,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:37,957 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash -923654555, now seen corresponding path program 2 times [2019-12-27 18:14:37,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:37,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693264330] [2019-12-27 18:14:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:38,343 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 18:14:38,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693264330] [2019-12-27 18:14:38,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:38,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:14:38,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555405088] [2019-12-27 18:14:38,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:38,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:38,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 322 transitions. [2019-12-27 18:14:38,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:38,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:14:38,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:14:38,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:38,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:14:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:14:38,782 INFO L87 Difference]: Start difference. First operand 2695 states and 7503 transitions. Second operand 19 states. [2019-12-27 18:14:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:43,586 INFO L93 Difference]: Finished difference Result 13782 states and 37434 transitions. [2019-12-27 18:14:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 18:14:43,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 18:14:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:43,592 INFO L225 Difference]: With dead ends: 13782 [2019-12-27 18:14:43,593 INFO L226 Difference]: Without dead ends: 3920 [2019-12-27 18:14:43,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=965, Invalid=3727, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 18:14:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-12-27 18:14:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 1771. [2019-12-27 18:14:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-12-27 18:14:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 4877 transitions. [2019-12-27 18:14:43,660 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 4877 transitions. Word has length 68 [2019-12-27 18:14:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:43,660 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 4877 transitions. [2019-12-27 18:14:43,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:14:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 4877 transitions. [2019-12-27 18:14:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:43,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:43,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:43,662 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1093105687, now seen corresponding path program 3 times [2019-12-27 18:14:43,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:43,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098274788] [2019-12-27 18:14:43,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:43,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:14:43,806 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:14:43,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2028~0.base_21| 4)) (= 0 v_~x$w_buff0_used~0_815) (= v_~x$r_buff0_thd1~0_121 0) (= v_~x$flush_delayed~0_33 0) (= v_~y~0_122 0) (= 0 v_~x$r_buff0_thd3~0_131) (= 0 |v_ULTIMATE.start_main_~#t2028~0.offset_18|) (= 0 v_~x$r_buff1_thd3~0_199) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~weak$$choice2~0_113 0) (= v_~z~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1~0_221) (= 0 v_~weak$$choice0~0_15) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21|) 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x~0_181) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd2~0_212) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21|) |v_ULTIMATE.start_main_~#t2028~0.offset_18| 0))) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~x$r_buff1_thd0~0_296 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21| 1)) (= 0 v_~__unbuffered_p2_EAX~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2028~0.base_21|) (= 0 v_~x$w_buff0~0_269))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_22|, ~x$w_buff0~0=v_~x$w_buff0~0_269, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_131, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_33|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_~#t2028~0.base=|v_ULTIMATE.start_main_~#t2028~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_112|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_22|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_32|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_118|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_18|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_26|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~y~0=v_~y~0_122, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_~#t2028~0.offset=|v_ULTIMATE.start_main_~#t2028~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_60|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_815, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t2029~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2029~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2028~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2030~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2028~0.offset, ~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, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:14:43,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13|) |v_ULTIMATE.start_main_~#t2029~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2029~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2029~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2029~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2029~0.offset] because there is no mapped edge [2019-12-27 18:14:43,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= 2 v_~x$w_buff0~0_30) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= v_~x$w_buff0~0_31 v_~x$w_buff1~0_21) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_30, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} 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 18:14:43,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2030~0.base_9| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2030~0.offset_8| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2030~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2030~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9|) |v_ULTIMATE.start_main_~#t2030~0.offset_8| 2))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2030~0.offset, #length] because there is no mapped edge [2019-12-27 18:14:43,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-714823285 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-714823285 256) 0))) (or (and (= ~x~0_In-714823285 |P2Thread1of1ForFork2_#t~ite15_Out-714823285|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-714823285| ~x$w_buff1~0_In-714823285) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-714823285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-714823285, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-714823285, ~x~0=~x~0_In-714823285} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-714823285|, ~x$w_buff1~0=~x$w_buff1~0_In-714823285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-714823285, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-714823285, ~x~0=~x~0_In-714823285} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:14:43,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 18:14:43,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1304621756 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1304621756 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1304621756 |P2Thread1of1ForFork2_#t~ite17_Out1304621756|)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1304621756| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1304621756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1304621756, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1304621756|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:14:43,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1459891929 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1459891929 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1459891929 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1459891929 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1459891929|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1459891929 |P2Thread1of1ForFork2_#t~ite18_Out-1459891929|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459891929, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1459891929, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1459891929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459891929, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1459891929, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1459891929, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1459891929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:14:43,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-170796629 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-170796629 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-170796629| ~x$r_buff0_thd3~0_In-170796629)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-170796629| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-170796629, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-170796629} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-170796629, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-170796629|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-170796629} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:14:43,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-807189251 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-807189251 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-807189251 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-807189251 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-807189251| ~x$r_buff1_thd3~0_In-807189251)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite20_Out-807189251| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-807189251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807189251, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-807189251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-807189251} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-807189251|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-807189251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807189251, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-807189251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-807189251} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:14:43,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_56| v_~x$r_buff1_thd3~0_147) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_55|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:14:43,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-287655232| |P0Thread1of1ForFork0_#t~ite3_Out-287655232|)) (.cse2 (= (mod ~x$w_buff1_used~0_In-287655232 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-287655232 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-287655232 |P0Thread1of1ForFork0_#t~ite3_Out-287655232|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~x~0_In-287655232 |P0Thread1of1ForFork0_#t~ite3_Out-287655232|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-287655232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-287655232, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-287655232, ~x~0=~x~0_In-287655232} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-287655232|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-287655232|, ~x$w_buff1~0=~x$w_buff1~0_In-287655232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-287655232, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-287655232, ~x~0=~x~0_In-287655232} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 18:14:43,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In50740794 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In50740794 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out50740794|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out50740794| ~x$w_buff0_used~0_In50740794)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In50740794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50740794} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out50740794|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In50740794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In50740794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:14:43,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1158321458 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1158321458 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1158321458 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1158321458 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1158321458| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1158321458| ~x$w_buff1_used~0_In1158321458) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1158321458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1158321458, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1158321458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1158321458} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1158321458|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1158321458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1158321458, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1158321458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1158321458} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:14:43,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1022309 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1022309 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1022309| ~x$r_buff0_thd1~0_In-1022309)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1022309|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022309} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022309, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1022309|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022309} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 18:14:43,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-199039435 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-199039435 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-199039435 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-199039435 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-199039435 |P0Thread1of1ForFork0_#t~ite8_Out-199039435|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-199039435|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-199039435, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-199039435, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-199039435, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199039435} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-199039435, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-199039435|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-199039435, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-199039435, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199039435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:14:43,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_126 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126} 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 18:14:43,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In113995089 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In113995089 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out113995089| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out113995089| ~x$w_buff0_used~0_In113995089)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In113995089, ~x$w_buff0_used~0=~x$w_buff0_used~0_In113995089} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out113995089|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In113995089, ~x$w_buff0_used~0=~x$w_buff0_used~0_In113995089} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:14:43,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In599147903 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In599147903 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In599147903 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In599147903 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out599147903|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In599147903 |P1Thread1of1ForFork1_#t~ite12_Out599147903|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In599147903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In599147903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In599147903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599147903} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In599147903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In599147903, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out599147903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In599147903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599147903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:14:43,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1109446067 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1109446067 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1109446067 ~x$r_buff0_thd2~0_Out-1109446067)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1109446067) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1109446067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1109446067} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1109446067|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1109446067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1109446067} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:14:43,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-45115231 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-45115231 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-45115231 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-45115231 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-45115231| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out-45115231| ~x$r_buff1_thd2~0_In-45115231)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-45115231, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-45115231, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-45115231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45115231} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-45115231, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-45115231, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-45115231, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-45115231|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45115231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:14:43,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, 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 18:14:43,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:14:43,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out-740298771| |ULTIMATE.start_main_#t~ite25_Out-740298771|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-740298771 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-740298771 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-740298771 |ULTIMATE.start_main_#t~ite24_Out-740298771|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~x~0_In-740298771 |ULTIMATE.start_main_#t~ite24_Out-740298771|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-740298771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-740298771, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-740298771, ~x~0=~x~0_In-740298771} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-740298771, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-740298771|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-740298771|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-740298771, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-740298771, ~x~0=~x~0_In-740298771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:14:43,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In943081861 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In943081861 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out943081861|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out943081861| ~x$w_buff0_used~0_In943081861) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In943081861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943081861} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In943081861, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out943081861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943081861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:14:43,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1850809648 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1850809648 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1850809648 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1850809648 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1850809648 |ULTIMATE.start_main_#t~ite27_Out-1850809648|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1850809648|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850809648, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850809648, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850809648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850809648, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850809648, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1850809648|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850809648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:14:43,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In886888038 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In886888038 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In886888038 |ULTIMATE.start_main_#t~ite28_Out886888038|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out886888038| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886888038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886888038} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886888038, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out886888038|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886888038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:14:43,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-206261261 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-206261261 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-206261261 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-206261261 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-206261261| ~x$r_buff1_thd0~0_In-206261261)) (and (= |ULTIMATE.start_main_#t~ite29_Out-206261261| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-206261261, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-206261261, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-206261261, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-206261261|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-206261261, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:14:43,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff0_thd0~0_110) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:14:43,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_151) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_151, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:14:43,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:14:43,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:14:43 BasicIcfg [2019-12-27 18:14:43,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:14:43,984 INFO L168 Benchmark]: Toolchain (without parser) took 105947.23 ms. Allocated memory was 137.4 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 100.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 399.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,984 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,986 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,987 INFO L168 Benchmark]: RCFGBuilder took 819.13 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,988 INFO L168 Benchmark]: TraceAbstraction took 104265.58 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 334.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:43,992 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.40 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.13 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104265.58 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 334.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 6170 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 87419 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] 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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 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) [L827] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 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)) [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 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)) [L829] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 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)) [L830] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 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)) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2999 SDtfs, 3799 SDslu, 7545 SDs, 0 SdLazy, 6860 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 81 SyntacticMatches, 42 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred 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: 43.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 99370 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 983 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 179683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...