/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:09:55,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:09:55,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:09:55,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:09:55,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:09:55,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:09:55,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:09:55,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:09:55,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:09:55,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:09:55,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:09:55,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:09:55,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:09:55,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:09:55,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:09:55,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:09:55,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:09:55,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:09:55,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:09:55,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:09:55,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:09:55,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:09:55,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:09:55,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:09:56,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:09:56,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:09:56,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:09:56,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:09:56,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:09:56,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:09:56,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:09:56,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:09:56,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:09:56,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:09:56,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:09:56,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:09:56,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:09:56,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:09:56,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:09:56,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:09:56,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:09:56,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:09:56,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:09:56,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:09:56,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:09:56,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:09:56,035 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:09:56,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:09:56,035 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:09:56,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:09:56,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:09:56,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:09:56,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:09:56,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:09:56,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:09:56,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:09:56,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:09:56,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:09:56,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:09:56,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:09:56,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:09:56,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:09:56,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:09:56,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:09:56,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:09:56,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:09:56,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:09:56,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:09:56,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:09:56,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:09:56,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:09:56,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:09:56,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:09:56,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:09:56,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:09:56,322 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:09:56,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-27 04:09:56,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6ae7340/b4d212696d57471ead3bc3042ec96463/FLAG574f10158 [2019-12-27 04:09:56,954 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:09:56,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-27 04:09:56,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6ae7340/b4d212696d57471ead3bc3042ec96463/FLAG574f10158 [2019-12-27 04:09:57,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6ae7340/b4d212696d57471ead3bc3042ec96463 [2019-12-27 04:09:57,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:09:57,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:09:57,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:09:57,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:09:57,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:09:57,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6b9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57, skipping insertion in model container [2019-12-27 04:09:57,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:09:57,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:09:57,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:09:57,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:09:57,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:09:58,059 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:09:58,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58 WrapperNode [2019-12-27 04:09:58,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:09:58,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:09:58,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:09:58,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:09:58,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:09:58,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:09:58,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:09:58,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:09:58,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... [2019-12-27 04:09:58,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:09:58,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:09:58,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:09:58,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:09:58,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:09:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:09:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:09:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:09:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:09:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:09:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:09:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:09:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:09:58,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:09:58,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:09:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:09:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:09:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:09:58,267 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 04:09:59,175 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:09:59,175 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:09:59,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:09:59 BoogieIcfgContainer [2019-12-27 04:09:59,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:09:59,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:09:59,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:09:59,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:09:59,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:09:57" (1/3) ... [2019-12-27 04:09:59,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b090ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:09:59, skipping insertion in model container [2019-12-27 04:09:59,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:58" (2/3) ... [2019-12-27 04:09:59,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b090ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:09:59, skipping insertion in model container [2019-12-27 04:09:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:09:59" (3/3) ... [2019-12-27 04:09:59,185 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2019-12-27 04:09:59,195 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:09:59,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:09:59,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:09:59,203 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:09:59,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,259 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:59,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:09:59,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:09:59,351 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:09:59,351 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:09:59,351 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:09:59,351 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:09:59,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:09:59,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:09:59,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:09:59,379 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 04:09:59,381 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 04:09:59,485 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 04:09:59,486 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:09:59,501 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:09:59,521 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 04:09:59,575 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 04:09:59,575 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:09:59,582 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:09:59,599 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 04:09:59,600 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:10:04,655 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 04:10:04,773 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 04:10:04,795 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-27 04:10:04,795 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 04:10:04,799 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-27 04:10:05,765 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-27 04:10:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-27 04:10:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:10:05,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:05,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:05,773 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 04:10:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-27 04:10:05,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:05,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80575072] [2019-12-27 04:10:05,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:06,027 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 04:10:06,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80575072] [2019-12-27 04:10:06,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:06,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:10:06,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447999459] [2019-12-27 04:10:06,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:06,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:06,053 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-27 04:10:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:06,355 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-27 04:10:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:06,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 04:10:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:06,541 INFO L225 Difference]: With dead ends: 15586 [2019-12-27 04:10:06,542 INFO L226 Difference]: Without dead ends: 15248 [2019-12-27 04:10:06,543 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 04:10:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-27 04:10:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-27 04:10:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-27 04:10:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-27 04:10:07,874 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-27 04:10:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-27 04:10:07,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-27 04:10:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:07,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:07,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:07,895 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 04:10:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-27 04:10:07,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:07,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291665597] [2019-12-27 04:10:07,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:08,038 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 04:10:08,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291665597] [2019-12-27 04:10:08,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:08,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220916124] [2019-12-27 04:10:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:08,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:08,043 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-27 04:10:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:08,598 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-27 04:10:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:08,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:10:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:08,699 INFO L225 Difference]: With dead ends: 24364 [2019-12-27 04:10:08,699 INFO L226 Difference]: Without dead ends: 24350 [2019-12-27 04:10:08,700 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 04:10:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-27 04:10:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-27 04:10:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-27 04:10:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-27 04:10:09,630 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-27 04:10:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:09,631 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-27 04:10:09,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-27 04:10:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:09,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:09,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:09,633 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 04:10:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-27 04:10:09,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:09,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545821434] [2019-12-27 04:10:09,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:09,714 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 04:10:09,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545821434] [2019-12-27 04:10:09,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:09,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:09,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629964934] [2019-12-27 04:10:09,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:09,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:09,717 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-27 04:10:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:09,761 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-27 04:10:09,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:09,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 04:10:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:09,787 INFO L225 Difference]: With dead ends: 12388 [2019-12-27 04:10:09,787 INFO L226 Difference]: Without dead ends: 12388 [2019-12-27 04:10:09,788 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 04:10:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-27 04:10:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-27 04:10:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-27 04:10:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-27 04:10:10,982 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-27 04:10:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:10,984 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-27 04:10:10,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-27 04:10:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:10:10,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:10,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:10,987 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 04:10:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-27 04:10:10,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:10,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340134309] [2019-12-27 04:10:10,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,077 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 04:10:11,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340134309] [2019-12-27 04:10:11,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:11,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768623456] [2019-12-27 04:10:11,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:11,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:11,079 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-27 04:10:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,103 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-27 04:10:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:10:11,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:10:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,107 INFO L225 Difference]: With dead ends: 1903 [2019-12-27 04:10:11,107 INFO L226 Difference]: Without dead ends: 1903 [2019-12-27 04:10:11,108 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 04:10:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-27 04:10:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-27 04:10:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-27 04:10:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-27 04:10:11,141 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-27 04:10:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,141 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-27 04:10:11,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-27 04:10:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:10:11,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,144 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 04:10:11,144 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 04:10:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-27 04:10:11,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913658942] [2019-12-27 04:10:11,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,243 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 04:10:11,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913658942] [2019-12-27 04:10:11,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:11,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470900798] [2019-12-27 04:10:11,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:11,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:11,245 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-27 04:10:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,267 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-27 04:10:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:11,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 04:10:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,270 INFO L225 Difference]: With dead ends: 669 [2019-12-27 04:10:11,270 INFO L226 Difference]: Without dead ends: 669 [2019-12-27 04:10:11,270 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 04:10:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-27 04:10:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-27 04:10:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 04:10:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-27 04:10:11,281 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-27 04:10:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,281 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-27 04:10:11,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-27 04:10:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:11,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:11,285 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 04:10:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-27 04:10:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256525043] [2019-12-27 04:10:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,391 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 04:10:11,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256525043] [2019-12-27 04:10:11,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:11,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691790801] [2019-12-27 04:10:11,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:11,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:11,394 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-27 04:10:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,431 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-27 04:10:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:11,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 04:10:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,434 INFO L225 Difference]: With dead ends: 610 [2019-12-27 04:10:11,434 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 04:10:11,434 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 04:10:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 04:10:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-27 04:10:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 04:10:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-27 04:10:11,443 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-27 04:10:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,443 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-27 04:10:11,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-27 04:10:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:10:11,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:11,446 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 04:10:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-27 04:10:11,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616354711] [2019-12-27 04:10:11,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,567 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 04:10:11,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616354711] [2019-12-27 04:10:11,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:11,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712808299] [2019-12-27 04:10:11,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:11,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:11,572 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 3 states. [2019-12-27 04:10:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,610 INFO L93 Difference]: Finished difference Result 605 states and 1414 transitions. [2019-12-27 04:10:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:11,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 04:10:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,612 INFO L225 Difference]: With dead ends: 605 [2019-12-27 04:10:11,612 INFO L226 Difference]: Without dead ends: 605 [2019-12-27 04:10:11,613 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 04:10:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-27 04:10:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 498. [2019-12-27 04:10:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-27 04:10:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1175 transitions. [2019-12-27 04:10:11,623 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1175 transitions. Word has length 54 [2019-12-27 04:10:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,624 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1175 transitions. [2019-12-27 04:10:11,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1175 transitions. [2019-12-27 04:10:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:11,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,626 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 04:10:11,626 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 04:10:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash 234191309, now seen corresponding path program 1 times [2019-12-27 04:10:11,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910195390] [2019-12-27 04:10:11,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,719 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 04:10:11,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910195390] [2019-12-27 04:10:11,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:11,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500417449] [2019-12-27 04:10:11,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:11,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:11,721 INFO L87 Difference]: Start difference. First operand 498 states and 1175 transitions. Second operand 3 states. [2019-12-27 04:10:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,734 INFO L93 Difference]: Finished difference Result 498 states and 1149 transitions. [2019-12-27 04:10:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:11,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 04:10:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,735 INFO L225 Difference]: With dead ends: 498 [2019-12-27 04:10:11,735 INFO L226 Difference]: Without dead ends: 498 [2019-12-27 04:10:11,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-27 04:10:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2019-12-27 04:10:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-27 04:10:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1149 transitions. [2019-12-27 04:10:11,743 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1149 transitions. Word has length 55 [2019-12-27 04:10:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,744 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1149 transitions. [2019-12-27 04:10:11,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1149 transitions. [2019-12-27 04:10:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:11,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:11,747 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 04:10:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -529490788, now seen corresponding path program 1 times [2019-12-27 04:10:11,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291933214] [2019-12-27 04:10:11,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:11,912 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 04:10:11,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291933214] [2019-12-27 04:10:11,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:11,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:11,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226437251] [2019-12-27 04:10:11,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:11,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:11,915 INFO L87 Difference]: Start difference. First operand 498 states and 1149 transitions. Second operand 5 states. [2019-12-27 04:10:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:11,956 INFO L93 Difference]: Finished difference Result 705 states and 1519 transitions. [2019-12-27 04:10:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:11,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 04:10:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:11,957 INFO L225 Difference]: With dead ends: 705 [2019-12-27 04:10:11,957 INFO L226 Difference]: Without dead ends: 436 [2019-12-27 04:10:11,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:10:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-12-27 04:10:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2019-12-27 04:10:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 04:10:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-27 04:10:11,964 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 56 [2019-12-27 04:10:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:11,964 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-27 04:10:11,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-27 04:10:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:11,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:11,966 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 04:10:11,966 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 04:10:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 2 times [2019-12-27 04:10:11,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:11,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367501907] [2019-12-27 04:10:11,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:12,081 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 04:10:12,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367501907] [2019-12-27 04:10:12,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:12,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:12,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420591869] [2019-12-27 04:10:12,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:12,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:12,083 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 5 states. [2019-12-27 04:10:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:12,123 INFO L93 Difference]: Finished difference Result 623 states and 1300 transitions. [2019-12-27 04:10:12,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:12,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 04:10:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:12,124 INFO L225 Difference]: With dead ends: 623 [2019-12-27 04:10:12,124 INFO L226 Difference]: Without dead ends: 220 [2019-12-27 04:10:12,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:10:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-27 04:10:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-12-27 04:10:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 04:10:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-27 04:10:12,129 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-27 04:10:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:12,129 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-27 04:10:12,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-27 04:10:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:12,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:12,130 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 04:10:12,131 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 04:10:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 3 times [2019-12-27 04:10:12,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:12,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915581945] [2019-12-27 04:10:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:12,831 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 04:10:12,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915581945] [2019-12-27 04:10:12,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:12,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:10:12,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596298777] [2019-12-27 04:10:12,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:10:12,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:10:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:10:12,836 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 20 states. [2019-12-27 04:10:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:14,578 INFO L93 Difference]: Finished difference Result 440 states and 768 transitions. [2019-12-27 04:10:14,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:10:14,579 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 04:10:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:14,580 INFO L225 Difference]: With dead ends: 440 [2019-12-27 04:10:14,580 INFO L226 Difference]: Without dead ends: 410 [2019-12-27 04:10:14,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1245, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:10:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-12-27 04:10:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 304. [2019-12-27 04:10:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-12-27 04:10:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 528 transitions. [2019-12-27 04:10:14,586 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 528 transitions. Word has length 56 [2019-12-27 04:10:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:14,587 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 528 transitions. [2019-12-27 04:10:14,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:10:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 528 transitions. [2019-12-27 04:10:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:14,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:14,588 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 04:10:14,588 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 04:10:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 4 times [2019-12-27 04:10:14,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:14,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687358845] [2019-12-27 04:10:14,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:14,826 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 04:10:14,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687358845] [2019-12-27 04:10:14,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:14,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:10:14,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347999506] [2019-12-27 04:10:14,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:10:14,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:10:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:10:14,828 INFO L87 Difference]: Start difference. First operand 304 states and 528 transitions. Second operand 12 states. [2019-12-27 04:10:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:15,202 INFO L93 Difference]: Finished difference Result 452 states and 770 transitions. [2019-12-27 04:10:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:10:15,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 04:10:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:15,203 INFO L225 Difference]: With dead ends: 452 [2019-12-27 04:10:15,203 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 04:10:15,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:10:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 04:10:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 328. [2019-12-27 04:10:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 04:10:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-27 04:10:15,209 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-27 04:10:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:15,210 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-27 04:10:15,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:10:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-27 04:10:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:15,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:15,211 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 04:10:15,211 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 04:10:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 5 times [2019-12-27 04:10:15,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:15,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362225468] [2019-12-27 04:10:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:15,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:10:15,308 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:10:15,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_54) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2492~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_108) (= (store .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27| 1) |v_#valid_59|) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2492~0.base_27| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t2492~0.offset_20|) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27|) |v_ULTIMATE.start_main_~#t2492~0.offset_20| 0))) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_17|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_~#t2492~0.offset=|v_ULTIMATE.start_main_~#t2492~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_20|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_~#t2492~0.base=|v_ULTIMATE.start_main_~#t2492~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} 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_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2494~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2494~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2493~0.offset, 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_~#t2492~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2493~0.base, 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_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2492~0.base, ~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 04:10:15,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2493~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t2493~0.offset_9| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9|) |v_ULTIMATE.start_main_~#t2493~0.offset_9| 1))) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2493~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2493~0.base] because there is no mapped edge [2019-12-27 04:10:15,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10|) |v_ULTIMATE.start_main_~#t2494~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10| 1) |v_#valid_31|) (not (= 0 |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2494~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2494~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2494~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2494~0.offset] because there is no mapped edge [2019-12-27 04:10:15,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= 0 (mod ~y$w_buff1_used~0_Out719550897 256)) (= ~y$w_buff0_used~0_Out719550897 1) (= ~y$w_buff1~0_Out719550897 ~y$w_buff0~0_In719550897) (= 2 ~y$w_buff0~0_Out719550897) (= |P2Thread1of1ForFork0_#in~arg.base_In719550897| P2Thread1of1ForFork0_~arg.base_Out719550897) (= ~y$w_buff1_used~0_Out719550897 ~y$w_buff0_used~0_In719550897) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out719550897 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out719550897|) (= |P2Thread1of1ForFork0_#in~arg.offset_In719550897| P2Thread1of1ForFork0_~arg.offset_Out719550897) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out719550897|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In719550897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In719550897, ~y$w_buff0~0=~y$w_buff0~0_In719550897, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In719550897|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out719550897, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out719550897|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In719550897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out719550897, ~y$w_buff1~0=~y$w_buff1~0_Out719550897, ~y$w_buff0~0=~y$w_buff0~0_Out719550897, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out719550897, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In719550897|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out719550897, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out719550897} 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 04:10:15,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 04:10:15,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-825217171 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-825217171 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-825217171| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-825217171 |P2Thread1of1ForFork0_#t~ite11_Out-825217171|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-825217171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-825217171} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-825217171, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-825217171|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-825217171} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 04:10:15,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out155308371| |P1Thread1of1ForFork2_#t~ite4_Out155308371|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In155308371 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In155308371 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out155308371| ~y$w_buff1~0_In155308371)) (and .cse2 (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out155308371| ~y~0_In155308371)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In155308371, ~y$w_buff1~0=~y$w_buff1~0_In155308371, ~y~0=~y~0_In155308371, ~y$w_buff1_used~0=~y$w_buff1_used~0_In155308371} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In155308371, ~y$w_buff1~0=~y$w_buff1~0_In155308371, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out155308371|, ~y~0=~y~0_In155308371, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out155308371|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In155308371} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 04:10:15,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1192956191 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1192956191 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1192956191 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1192956191 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1192956191 |P2Thread1of1ForFork0_#t~ite12_Out-1192956191|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-1192956191|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1192956191, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192956191, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1192956191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192956191} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1192956191, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192956191, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1192956191|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1192956191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192956191} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 04:10:15,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-938049340 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-938049340 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-938049340 |P1Thread1of1ForFork2_#t~ite5_Out-938049340|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-938049340|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938049340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-938049340} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-938049340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-938049340, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-938049340|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 04:10:15,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-779345567 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-779345567 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-779345567 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-779345567 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-779345567|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-779345567 |P1Thread1of1ForFork2_#t~ite6_Out-779345567|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-779345567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-779345567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-779345567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-779345567} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-779345567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-779345567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-779345567, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-779345567|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-779345567} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 04:10:15,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1245179757 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1245179757 256)))) (or (and (= ~y$r_buff0_thd2~0_In-1245179757 |P1Thread1of1ForFork2_#t~ite7_Out-1245179757|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1245179757|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245179757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245179757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245179757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245179757, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1245179757|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 04:10:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2093751312 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In2093751312 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2093751312 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In2093751312 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out2093751312|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In2093751312 |P1Thread1of1ForFork2_#t~ite8_Out2093751312|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2093751312, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2093751312, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2093751312, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2093751312} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2093751312, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2093751312, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out2093751312|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2093751312, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2093751312} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 04:10:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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 04:10:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1095720190 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1095720190 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-1095720190) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1095720190 ~y$r_buff0_thd3~0_Out-1095720190)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095720190, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1095720190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095720190, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1095720190, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1095720190|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 04:10:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1983572653 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1983572653 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1983572653 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1983572653 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out1983572653| ~y$r_buff1_thd3~0_In1983572653) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1983572653|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1983572653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1983572653, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1983572653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983572653} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1983572653|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1983572653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1983572653, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1983572653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983572653} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 04:10:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, 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 04:10:15,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~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 04:10:15,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2000974988 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2000974988 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-2000974988| |ULTIMATE.start_main_#t~ite18_Out-2000974988|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-2000974988| ~y~0_In-2000974988) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-2000974988| ~y$w_buff1~0_In-2000974988) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2000974988, ~y~0=~y~0_In-2000974988, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2000974988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2000974988} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2000974988, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2000974988|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2000974988|, ~y~0=~y~0_In-2000974988, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2000974988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2000974988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 04:10:15,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-210806411 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-210806411 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-210806411| ~y$w_buff0_used~0_In-210806411)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-210806411| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-210806411, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-210806411} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-210806411, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-210806411, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-210806411|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 04:10:15,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1718695546 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1718695546 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1718695546 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1718695546 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1718695546|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1718695546 |ULTIMATE.start_main_#t~ite21_Out-1718695546|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1718695546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1718695546, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1718695546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1718695546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1718695546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1718695546, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1718695546|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1718695546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1718695546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 04:10:15,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-122944541 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-122944541 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-122944541| ~y$r_buff0_thd0~0_In-122944541)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-122944541| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-122944541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-122944541} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-122944541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-122944541, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-122944541|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 04:10:15,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1580289016 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1580289016 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1580289016 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1580289016 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1580289016 |ULTIMATE.start_main_#t~ite23_Out1580289016|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1580289016|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580289016, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580289016, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580289016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580289016} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580289016, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580289016, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580289016, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1580289016|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580289016} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 04:10:15,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In347782832 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out347782832| ~y$w_buff0~0_In347782832) (= |ULTIMATE.start_main_#t~ite29_In347782832| |ULTIMATE.start_main_#t~ite29_Out347782832|)) (and (= |ULTIMATE.start_main_#t~ite30_Out347782832| |ULTIMATE.start_main_#t~ite29_Out347782832|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In347782832 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In347782832 256)) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In347782832 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In347782832 256)))) (= ~y$w_buff0~0_In347782832 |ULTIMATE.start_main_#t~ite29_Out347782832|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In347782832, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In347782832|, ~y$w_buff0~0=~y$w_buff0~0_In347782832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In347782832, ~weak$$choice2~0=~weak$$choice2~0_In347782832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In347782832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347782832} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out347782832|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347782832, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out347782832|, ~y$w_buff0~0=~y$w_buff0~0_In347782832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In347782832, ~weak$$choice2~0=~weak$$choice2~0_In347782832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In347782832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In347782832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 04:10:15,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-811123584 256)))) (or (and (= ~y$w_buff1~0_In-811123584 |ULTIMATE.start_main_#t~ite33_Out-811123584|) (= |ULTIMATE.start_main_#t~ite32_In-811123584| |ULTIMATE.start_main_#t~ite32_Out-811123584|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-811123584 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-811123584 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-811123584 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-811123584 256)))) (= |ULTIMATE.start_main_#t~ite32_Out-811123584| ~y$w_buff1~0_In-811123584) (= |ULTIMATE.start_main_#t~ite32_Out-811123584| |ULTIMATE.start_main_#t~ite33_Out-811123584|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-811123584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-811123584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-811123584, ~weak$$choice2~0=~weak$$choice2~0_In-811123584, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-811123584, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-811123584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-811123584} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-811123584, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-811123584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-811123584, ~weak$$choice2~0=~weak$$choice2~0_In-811123584, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-811123584|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-811123584, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-811123584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-811123584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 04:10:15,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1835209637 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1835209637 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1835209637 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1835209637 256))) (and (= (mod ~y$w_buff1_used~0_In1835209637 256) 0) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite36_Out1835209637| |ULTIMATE.start_main_#t~ite35_Out1835209637|) (= ~y$w_buff0_used~0_In1835209637 |ULTIMATE.start_main_#t~ite35_Out1835209637|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_In1835209637| |ULTIMATE.start_main_#t~ite35_Out1835209637|) (= |ULTIMATE.start_main_#t~ite36_Out1835209637| ~y$w_buff0_used~0_In1835209637)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1835209637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1835209637, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1835209637|, ~weak$$choice2~0=~weak$$choice2~0_In1835209637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1835209637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835209637} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1835209637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1835209637, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1835209637|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1835209637|, ~weak$$choice2~0=~weak$$choice2~0_In1835209637, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1835209637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835209637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 04:10:15,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 04:10:15,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~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 04:10:15,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->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 04:10:15,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:10:15 BasicIcfg [2019-12-27 04:10:15,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:10:15,432 INFO L168 Benchmark]: Toolchain (without parser) took 18158.50 ms. Allocated memory was 139.5 MB in the beginning and 805.8 MB in the end (delta: 666.4 MB). Free memory was 101.0 MB in the beginning and 567.8 MB in the end (delta: -466.8 MB). Peak memory consumption was 199.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,433 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:10:15,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.38 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 157.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.80 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,436 INFO L168 Benchmark]: Boogie Preprocessor took 35.45 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,436 INFO L168 Benchmark]: RCFGBuilder took 1001.82 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 106.1 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,437 INFO L168 Benchmark]: TraceAbstraction took 16252.03 ms. Allocated memory was 203.9 MB in the beginning and 805.8 MB in the end (delta: 601.9 MB). Free memory was 106.1 MB in the beginning and 567.8 MB in the end (delta: -461.6 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:15,444 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.47 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.38 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 157.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.80 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.45 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1001.82 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 106.1 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16252.03 ms. Allocated memory was 203.9 MB in the beginning and 805.8 MB in the end (delta: 601.9 MB). Free memory was 106.1 MB in the beginning and 567.8 MB in the end (delta: -461.6 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L800] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L802] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L775] 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 [__unbuffered_cnt=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] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L775] 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) [L746] 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, 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=2, 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] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 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) [L777] 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 [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L808] 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) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 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 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L819] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L819] 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) [L820] 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)) [L821] 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)) [L822] 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)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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$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)) [L825] 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)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1077 SDtfs, 928 SDslu, 2507 SDs, 0 SdLazy, 1734 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 3054 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 86523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...