/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:13:38,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:13:38,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:13:38,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:13:38,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:13:38,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:13:38,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:13:38,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:13:38,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:13:38,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:13:38,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:13:38,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:13:38,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:13:38,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:13:38,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:13:38,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:13:38,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:13:38,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:13:38,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:13:38,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:13:38,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:13:38,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:13:38,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:13:38,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:13:38,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:13:38,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:13:38,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:13:38,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:13:38,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:13:38,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:13:38,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:13:38,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:13:38,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:13:38,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:13:38,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:13:38,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:13:38,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:13:38,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:13:38,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:13:38,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:13:38,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:13:38,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:13:38,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:13:38,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:13:38,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:13:38,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:13:38,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:13:38,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:13:38,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:13:38,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:13:38,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:13:38,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:13:38,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:13:38,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:13:38,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:13:38,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:13:38,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:13:38,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:13:38,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:13:38,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:13:38,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:13:38,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:13:38,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:13:38,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:13:38,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:13:38,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:13:38,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:13:38,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:13:38,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:13:38,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:13:38,973 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:13:38,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:13:39,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:13:39,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:13:39,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:13:39,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:13:39,248 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:13:39,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 00:13:39,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f090fbeae/34dfa5c09c654db49169e9e6d0520e68/FLAGb39c89bf0 [2019-12-27 00:13:39,888 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:13:39,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 00:13:39,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f090fbeae/34dfa5c09c654db49169e9e6d0520e68/FLAGb39c89bf0 [2019-12-27 00:13:40,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f090fbeae/34dfa5c09c654db49169e9e6d0520e68 [2019-12-27 00:13:40,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:13:40,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:13:40,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:40,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:13:40,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:13:40,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40, skipping insertion in model container [2019-12-27 00:13:40,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:13:40,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:13:40,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:40,743 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:13:40,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:40,907 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:13:40,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40 WrapperNode [2019-12-27 00:13:40,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:40,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:40,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:13:40,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:13:40,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:40,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:13:40,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:13:40,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:13:40,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:40,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:41,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:41,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:41,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... [2019-12-27 00:13:41,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:13:41,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:13:41,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:13:41,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:13:41,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:13:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:13:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:13:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:13:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:13:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:13:41,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:13:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:13:41,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:13:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:13:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:13:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:13:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:13:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:13:41,079 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 00:13:41,782 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:13:41,783 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:13:41,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:41 BoogieIcfgContainer [2019-12-27 00:13:41,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:13:41,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:13:41,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:13:41,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:13:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:13:40" (1/3) ... [2019-12-27 00:13:41,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee54eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:41, skipping insertion in model container [2019-12-27 00:13:41,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:40" (2/3) ... [2019-12-27 00:13:41,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee54eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:41, skipping insertion in model container [2019-12-27 00:13:41,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:41" (3/3) ... [2019-12-27 00:13:41,793 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-27 00:13:41,802 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:13:41,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:13:41,816 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:13:41,817 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:13:41,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,857 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,858 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,884 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,884 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,890 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:41,909 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:13:41,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:13:41,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:13:41,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:13:41,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:13:41,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:13:41,956 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:13:41,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:13:41,957 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:13:41,982 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 00:13:41,992 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:13:42,095 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:13:42,095 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:42,113 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:13:42,132 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:13:42,200 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:13:42,200 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:42,206 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:13:42,219 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 00:13:42,221 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:13:47,167 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:13:47,271 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:13:47,298 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-27 00:13:47,298 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 00:13:47,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-27 00:13:48,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-27 00:13:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-27 00:13:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:13:48,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:48,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:48,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-27 00:13:48,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:48,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287601752] [2019-12-27 00:13:48,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:48,523 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 00:13:48,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287601752] [2019-12-27 00:13:48,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:48,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:13:48,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734801325] [2019-12-27 00:13:48,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:48,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:48,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:48,548 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-27 00:13:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:48,992 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-27 00:13:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:48,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 00:13:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:49,195 INFO L225 Difference]: With dead ends: 15638 [2019-12-27 00:13:49,195 INFO L226 Difference]: Without dead ends: 15326 [2019-12-27 00:13:49,197 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 00:13:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-27 00:13:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-27 00:13:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-27 00:13:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-27 00:13:50,029 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-27 00:13:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-27 00:13:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-27 00:13:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:13:50,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:50,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:50,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-27 00:13:50,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:50,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221198297] [2019-12-27 00:13:50,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:50,199 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 00:13:50,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221198297] [2019-12-27 00:13:50,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:50,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:50,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859766621] [2019-12-27 00:13:50,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:50,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:50,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:50,203 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-27 00:13:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:50,851 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-27 00:13:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:50,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:13:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:50,956 INFO L225 Difference]: With dead ends: 24490 [2019-12-27 00:13:50,957 INFO L226 Difference]: Without dead ends: 24476 [2019-12-27 00:13:50,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-27 00:13:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-27 00:13:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-27 00:13:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-27 00:13:52,939 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-27 00:13:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-27 00:13:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-27 00:13:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:13:52,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:52,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:52,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-27 00:13:52,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:52,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209675571] [2019-12-27 00:13:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:53,015 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 00:13:53,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209675571] [2019-12-27 00:13:53,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:53,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:53,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094441526] [2019-12-27 00:13:53,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:53,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:53,019 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-27 00:13:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:53,081 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-27 00:13:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:53,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:13:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:53,118 INFO L225 Difference]: With dead ends: 12702 [2019-12-27 00:13:53,118 INFO L226 Difference]: Without dead ends: 12702 [2019-12-27 00:13:53,119 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 00:13:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-27 00:13:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-27 00:13:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-27 00:13:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-27 00:13:53,467 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-27 00:13:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:53,467 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-27 00:13:53,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-27 00:13:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:13:53,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:53,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:53,469 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-27 00:13:53,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:53,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088207294] [2019-12-27 00:13:53,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:53,503 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 00:13:53,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088207294] [2019-12-27 00:13:53,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380255160] [2019-12-27 00:13:53,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:53,505 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-27 00:13:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:53,530 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-27 00:13:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:13:53,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:13:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:53,536 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 00:13:53,536 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 00:13:53,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 00:13:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 00:13:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 00:13:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-27 00:13:53,573 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-27 00:13:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:53,573 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-27 00:13:53,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-27 00:13:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:13:53,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:53,576 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] [2019-12-27 00:13:53,576 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-27 00:13:53,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:53,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623435942] [2019-12-27 00:13:53,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:53,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623435942] [2019-12-27 00:13:53,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:53,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:13:53,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175645990] [2019-12-27 00:13:53,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:53,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:53,644 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-27 00:13:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:53,672 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-27 00:13:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:53,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 00:13:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:53,674 INFO L225 Difference]: With dead ends: 630 [2019-12-27 00:13:53,674 INFO L226 Difference]: Without dead ends: 630 [2019-12-27 00:13:53,675 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 00:13:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-27 00:13:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-27 00:13:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 00:13:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-27 00:13:53,685 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-27 00:13:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:53,685 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-27 00:13:53,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-27 00:13:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:13:53,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:53,687 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] [2019-12-27 00:13:53,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-27 00:13:53,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:53,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090391978] [2019-12-27 00:13:53,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:53,759 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 00:13:53,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090391978] [2019-12-27 00:13:53,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:53,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:53,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079472873] [2019-12-27 00:13:53,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:53,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:53,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:53,762 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-27 00:13:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:53,820 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-27 00:13:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:53,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:13:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:53,822 INFO L225 Difference]: With dead ends: 584 [2019-12-27 00:13:53,822 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 00:13:53,823 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 00:13:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 00:13:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-27 00:13:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 00:13:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-27 00:13:53,835 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-27 00:13:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:53,836 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-27 00:13:53,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-27 00:13:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:13:53,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:53,838 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] [2019-12-27 00:13:53,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-27 00:13:53,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:53,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192591640] [2019-12-27 00:13:53,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:54,087 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 00:13:54,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192591640] [2019-12-27 00:13:54,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:54,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:54,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852309342] [2019-12-27 00:13:54,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:54,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:54,091 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 3 states. [2019-12-27 00:13:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:54,105 INFO L93 Difference]: Finished difference Result 580 states and 1326 transitions. [2019-12-27 00:13:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:54,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:13:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:54,106 INFO L225 Difference]: With dead ends: 580 [2019-12-27 00:13:54,107 INFO L226 Difference]: Without dead ends: 580 [2019-12-27 00:13:54,107 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 00:13:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-27 00:13:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-12-27 00:13:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 00:13:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1326 transitions. [2019-12-27 00:13:54,117 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1326 transitions. Word has length 55 [2019-12-27 00:13:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:54,119 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1326 transitions. [2019-12-27 00:13:54,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1326 transitions. [2019-12-27 00:13:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:54,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:54,121 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] [2019-12-27 00:13:54,121 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1916501781, now seen corresponding path program 1 times [2019-12-27 00:13:54,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:54,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41626541] [2019-12-27 00:13:54,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:54,244 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 00:13:54,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41626541] [2019-12-27 00:13:54,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:54,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:54,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059242070] [2019-12-27 00:13:54,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:54,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:54,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:54,246 INFO L87 Difference]: Start difference. First operand 580 states and 1326 transitions. Second operand 5 states. [2019-12-27 00:13:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:54,448 INFO L93 Difference]: Finished difference Result 851 states and 1949 transitions. [2019-12-27 00:13:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:54,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 00:13:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:54,450 INFO L225 Difference]: With dead ends: 851 [2019-12-27 00:13:54,450 INFO L226 Difference]: Without dead ends: 851 [2019-12-27 00:13:54,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-27 00:13:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2019-12-27 00:13:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-27 00:13:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1530 transitions. [2019-12-27 00:13:54,462 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1530 transitions. Word has length 56 [2019-12-27 00:13:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:54,463 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1530 transitions. [2019-12-27 00:13:54,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1530 transitions. [2019-12-27 00:13:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:54,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:54,467 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] [2019-12-27 00:13:54,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 510672277, now seen corresponding path program 2 times [2019-12-27 00:13:54,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:54,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306797602] [2019-12-27 00:13:54,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:54,553 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 00:13:54,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306797602] [2019-12-27 00:13:54,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:54,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:54,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232475957] [2019-12-27 00:13:54,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:54,555 INFO L87 Difference]: Start difference. First operand 664 states and 1530 transitions. Second operand 3 states. [2019-12-27 00:13:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:54,598 INFO L93 Difference]: Finished difference Result 664 states and 1529 transitions. [2019-12-27 00:13:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:54,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 00:13:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:54,599 INFO L225 Difference]: With dead ends: 664 [2019-12-27 00:13:54,599 INFO L226 Difference]: Without dead ends: 664 [2019-12-27 00:13:54,600 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 00:13:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-12-27 00:13:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 475. [2019-12-27 00:13:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 00:13:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1091 transitions. [2019-12-27 00:13:54,609 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1091 transitions. Word has length 56 [2019-12-27 00:13:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1091 transitions. [2019-12-27 00:13:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1091 transitions. [2019-12-27 00:13:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:13:54,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:54,612 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] [2019-12-27 00:13:54,612 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash 700007354, now seen corresponding path program 1 times [2019-12-27 00:13:54,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:54,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256278348] [2019-12-27 00:13:54,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:54,779 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 00:13:54,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256278348] [2019-12-27 00:13:54,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:54,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:54,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740046975] [2019-12-27 00:13:54,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:54,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:54,781 INFO L87 Difference]: Start difference. First operand 475 states and 1091 transitions. Second operand 6 states. [2019-12-27 00:13:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:54,857 INFO L93 Difference]: Finished difference Result 717 states and 1531 transitions. [2019-12-27 00:13:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:54,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 00:13:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:54,858 INFO L225 Difference]: With dead ends: 717 [2019-12-27 00:13:54,858 INFO L226 Difference]: Without dead ends: 446 [2019-12-27 00:13:54,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-27 00:13:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 413. [2019-12-27 00:13:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 00:13:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 912 transitions. [2019-12-27 00:13:54,871 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 912 transitions. Word has length 57 [2019-12-27 00:13:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:54,872 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 912 transitions. [2019-12-27 00:13:54,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 912 transitions. [2019-12-27 00:13:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:13:54,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:54,876 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] [2019-12-27 00:13:54,876 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 2 times [2019-12-27 00:13:54,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:54,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120420400] [2019-12-27 00:13:54,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:55,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120420400] [2019-12-27 00:13:55,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:55,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:13:55,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534065459] [2019-12-27 00:13:55,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:55,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:55,194 INFO L87 Difference]: Start difference. First operand 413 states and 912 transitions. Second operand 13 states. [2019-12-27 00:13:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:56,003 INFO L93 Difference]: Finished difference Result 1066 states and 2249 transitions. [2019-12-27 00:13:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:13:56,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 00:13:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:56,006 INFO L225 Difference]: With dead ends: 1066 [2019-12-27 00:13:56,006 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 00:13:56,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:13:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 00:13:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-27 00:13:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 00:13:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 00:13:56,012 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 57 [2019-12-27 00:13:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:56,012 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 00:13:56,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 00:13:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:13:56,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:56,013 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] [2019-12-27 00:13:56,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 3 times [2019-12-27 00:13:56,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:56,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477783825] [2019-12-27 00:13:56,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:56,245 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 00:13:56,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477783825] [2019-12-27 00:13:56,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:56,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:13:56,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471029771] [2019-12-27 00:13:56,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:56,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:56,248 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 13 states. [2019-12-27 00:13:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:56,888 INFO L93 Difference]: Finished difference Result 419 states and 712 transitions. [2019-12-27 00:13:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:13:56,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 00:13:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:56,889 INFO L225 Difference]: With dead ends: 419 [2019-12-27 00:13:56,889 INFO L226 Difference]: Without dead ends: 386 [2019-12-27 00:13:56,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:13:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-27 00:13:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 277. [2019-12-27 00:13:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-27 00:13:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 480 transitions. [2019-12-27 00:13:56,893 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 480 transitions. Word has length 57 [2019-12-27 00:13:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:56,894 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 480 transitions. [2019-12-27 00:13:56,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 480 transitions. [2019-12-27 00:13:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:13:56,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:56,894 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] [2019-12-27 00:13:56,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash -550616912, now seen corresponding path program 4 times [2019-12-27 00:13:56,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:56,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446129724] [2019-12-27 00:13:56,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:57,181 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 00:13:57,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446129724] [2019-12-27 00:13:57,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:57,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:13:57,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520033286] [2019-12-27 00:13:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:57,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:57,184 INFO L87 Difference]: Start difference. First operand 277 states and 480 transitions. Second operand 13 states. [2019-12-27 00:13:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:57,638 INFO L93 Difference]: Finished difference Result 420 states and 707 transitions. [2019-12-27 00:13:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:13:57,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 00:13:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:57,640 INFO L225 Difference]: With dead ends: 420 [2019-12-27 00:13:57,640 INFO L226 Difference]: Without dead ends: 387 [2019-12-27 00:13:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:13:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-27 00:13:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2019-12-27 00:13:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 00:13:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-27 00:13:57,647 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 57 [2019-12-27 00:13:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:57,647 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-27 00:13:57,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-27 00:13:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:13:57,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:57,648 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] [2019-12-27 00:13:57,648 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 5 times [2019-12-27 00:13:57,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:57,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91884288] [2019-12-27 00:13:57,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:58,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 00:13:58,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91884288] [2019-12-27 00:13:58,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:58,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 00:13:58,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409750026] [2019-12-27 00:13:58,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 00:13:58,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 00:13:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:13:58,458 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 23 states. [2019-12-27 00:14:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:00,641 INFO L93 Difference]: Finished difference Result 687 states and 1142 transitions. [2019-12-27 00:14:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:14:00,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-27 00:14:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:00,643 INFO L225 Difference]: With dead ends: 687 [2019-12-27 00:14:00,643 INFO L226 Difference]: Without dead ends: 654 [2019-12-27 00:14:00,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 00:14:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-12-27 00:14:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 325. [2019-12-27 00:14:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-27 00:14:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 567 transitions. [2019-12-27 00:14:00,651 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 567 transitions. Word has length 57 [2019-12-27 00:14:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:00,651 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 567 transitions. [2019-12-27 00:14:00,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 00:14:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 567 transitions. [2019-12-27 00:14:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:00,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:00,653 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] [2019-12-27 00:14:00,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1227312486, now seen corresponding path program 6 times [2019-12-27 00:14:00,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:00,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540084821] [2019-12-27 00:14:00,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540084821] [2019-12-27 00:14:00,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:00,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:14:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681908644] [2019-12-27 00:14:00,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:14:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:14:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:14:00,866 INFO L87 Difference]: Start difference. First operand 325 states and 567 transitions. Second operand 12 states. [2019-12-27 00:14:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:01,307 INFO L93 Difference]: Finished difference Result 430 states and 725 transitions. [2019-12-27 00:14:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:14:01,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 00:14:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:01,308 INFO L225 Difference]: With dead ends: 430 [2019-12-27 00:14:01,308 INFO L226 Difference]: Without dead ends: 395 [2019-12-27 00:14:01,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:14:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-27 00:14:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 317. [2019-12-27 00:14:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 00:14:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-27 00:14:01,316 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 57 [2019-12-27 00:14:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:01,316 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-27 00:14:01,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:14:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-27 00:14:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:01,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:01,317 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] [2019-12-27 00:14:01,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 7 times [2019-12-27 00:14:01,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:01,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625026974] [2019-12-27 00:14:01,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:01,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:14:01,422 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:14:01,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$w_buff0~0_215) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~main$tmp_guard0~0_26 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2516~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:14:01,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 00:14:01,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-27 00:14:01,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:14:01,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 00:14:01,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1148003673 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1148003673 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-1148003673| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out-1148003673| ~y$w_buff0_used~0_In-1148003673) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1148003673, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1148003673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1148003673, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1148003673|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1148003673} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 00:14:01,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1485897469 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1485897469 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1485897469| |P1Thread1of1ForFork2_#t~ite3_Out-1485897469|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1485897469| ~y$w_buff1~0_In-1485897469) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1485897469| ~y~0_In-1485897469) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1485897469, ~y$w_buff1~0=~y$w_buff1~0_In-1485897469, ~y~0=~y~0_In-1485897469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1485897469} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1485897469, ~y$w_buff1~0=~y$w_buff1~0_In-1485897469, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1485897469|, ~y~0=~y~0_In-1485897469, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1485897469|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1485897469} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 00:14:01,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1292098117 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1292098117 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1292098117| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1292098117 |P1Thread1of1ForFork2_#t~ite5_Out-1292098117|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1292098117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1292098117} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1292098117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1292098117, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1292098117|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 00:14:01,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-99218390 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-99218390 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-99218390 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-99218390 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-99218390|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out-99218390| ~y$w_buff1_used~0_In-99218390) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-99218390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99218390, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-99218390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99218390} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-99218390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99218390, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-99218390|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-99218390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99218390} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 00:14:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1732036803 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1732036803 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1732036803 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1732036803 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1732036803 |P1Thread1of1ForFork2_#t~ite6_Out-1732036803|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-1732036803|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1732036803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732036803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1732036803, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732036803} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1732036803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732036803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1732036803, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1732036803|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732036803} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 00:14:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-225779159 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-225779159 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-225779159|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-225779159 |P1Thread1of1ForFork2_#t~ite7_Out-225779159|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-225779159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-225779159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-225779159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-225779159, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-225779159|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 00:14:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1350697295 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1350697295 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1350697295 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1350697295 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out1350697295| 0)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out1350697295| ~y$r_buff1_thd2~0_In1350697295) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1350697295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350697295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1350697295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350697295} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1350697295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350697295, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1350697295|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1350697295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350697295} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 00:14:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 00:14:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1569638113 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1569638113 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1569638113 ~y$r_buff0_thd3~0_In1569638113)) (and (= 0 ~y$r_buff0_thd3~0_Out1569638113) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1569638113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1569638113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1569638113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1569638113, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1569638113|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 00:14:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2027518250 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2027518250 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2027518250 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-2027518250 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-2027518250 |P2Thread1of1ForFork0_#t~ite14_Out-2027518250|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2027518250| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2027518250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027518250, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2027518250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2027518250} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2027518250|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2027518250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027518250, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2027518250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2027518250} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 00:14:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 00:14:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:14:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1502845717 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1502845717 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1502845717| |ULTIMATE.start_main_#t~ite19_Out1502845717|))) (or (and (not .cse0) (= ~y$w_buff1~0_In1502845717 |ULTIMATE.start_main_#t~ite18_Out1502845717|) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out1502845717| ~y~0_In1502845717) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1502845717, ~y~0=~y~0_In1502845717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1502845717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502845717} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1502845717, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1502845717|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1502845717|, ~y~0=~y~0_In1502845717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1502845717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502845717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:14:01,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In936952748 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In936952748 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out936952748|)) (and (= |ULTIMATE.start_main_#t~ite20_Out936952748| ~y$w_buff0_used~0_In936952748) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In936952748, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In936952748} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In936952748, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In936952748, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out936952748|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:14:01,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In228808781 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In228808781 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In228808781 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In228808781 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out228808781| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out228808781| ~y$w_buff1_used~0_In228808781) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In228808781, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In228808781, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In228808781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228808781} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In228808781, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In228808781, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out228808781|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In228808781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228808781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:14:01,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-992138213 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-992138213 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-992138213|)) (and (= |ULTIMATE.start_main_#t~ite22_Out-992138213| ~y$r_buff0_thd0~0_In-992138213) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-992138213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-992138213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-992138213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-992138213, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-992138213|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:14:01,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-567547790 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-567547790 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-567547790 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-567547790 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-567547790| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-567547790 |ULTIMATE.start_main_#t~ite23_Out-567547790|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-567547790, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-567547790, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-567547790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567547790} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-567547790, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-567547790, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-567547790, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-567547790|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567547790} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 00:14:01,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In976885738 256)))) (or (and (= ~y$w_buff1_used~0_In976885738 |ULTIMATE.start_main_#t~ite38_Out976885738|) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out976885738| |ULTIMATE.start_main_#t~ite38_Out976885738|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In976885738 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In976885738 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In976885738 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In976885738 256) 0))))) (and (= ~y$w_buff1_used~0_In976885738 |ULTIMATE.start_main_#t~ite39_Out976885738|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In976885738| |ULTIMATE.start_main_#t~ite38_Out976885738|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In976885738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In976885738, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In976885738|, ~weak$$choice2~0=~weak$$choice2~0_In976885738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In976885738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In976885738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In976885738, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out976885738|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In976885738, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out976885738|, ~weak$$choice2~0=~weak$$choice2~0_In976885738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In976885738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In976885738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 00:14:01,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 00:14:01,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:14:01,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:14:01,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:14:01 BasicIcfg [2019-12-27 00:14:01,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:14:01,539 INFO L168 Benchmark]: Toolchain (without parser) took 21386.84 ms. Allocated memory was 138.4 MB in the beginning and 881.3 MB in the end (delta: 742.9 MB). Free memory was 100.5 MB in the beginning and 372.7 MB in the end (delta: -272.1 MB). Peak memory consumption was 470.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,540 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:14:01,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.11 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 152.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,542 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,542 INFO L168 Benchmark]: RCFGBuilder took 769.23 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 104.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,543 INFO L168 Benchmark]: TraceAbstraction took 19751.50 ms. Allocated memory was 202.4 MB in the beginning and 881.3 MB in the end (delta: 679.0 MB). Free memory was 104.2 MB in the beginning and 372.7 MB in the end (delta: -268.5 MB). Peak memory consumption was 410.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:01,547 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 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.11 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 152.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.23 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 104.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19751.50 ms. Allocated memory was 202.4 MB in the beginning and 881.3 MB in the end (delta: 679.0 MB). Free memory was 104.2 MB in the beginning and 372.7 MB in the end (delta: -268.5 MB). Peak memory consumption was 410.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1490 SDtfs, 1891 SDslu, 5095 SDs, 0 SdLazy, 3521 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3357 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 158758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...