/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:14:55,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:14:55,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:14:55,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:14:55,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:14:55,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:14:55,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:14:55,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:14:55,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:14:55,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:14:55,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:14:55,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:14:55,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:14:55,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:14:55,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:14:55,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:14:55,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:14:55,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:14:55,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:14:56,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:14:56,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:14:56,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:14:56,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:14:56,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:14:56,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:14:56,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:14:56,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:14:56,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:14:56,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:14:56,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:14:56,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:14:56,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:14:56,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:14:56,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:14:56,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:14:56,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:14:56,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:14:56,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:14:56,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:14:56,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:14:56,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:14:56,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:14:56,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:14:56,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:14:56,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:14:56,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:14:56,053 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:14:56,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:14:56,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:14:56,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:14:56,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:14:56,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:14:56,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:14:56,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:14:56,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:14:56,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:14:56,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:14:56,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:14:56,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:14:56,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:14:56,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:14:56,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:14:56,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:14:56,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:14:56,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:14:56,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:14:56,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:14:56,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:14:56,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:14:56,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:14:56,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:14:56,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:14:56,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:14:56,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:14:56,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:14:56,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:14:56,355 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:14:56,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i [2019-12-27 06:14:56,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b0fd816/b5d496261f8d4c6fb204e71c3edacff9/FLAGbd0a6c593 [2019-12-27 06:14:57,070 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:14:57,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i [2019-12-27 06:14:57,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b0fd816/b5d496261f8d4c6fb204e71c3edacff9/FLAGbd0a6c593 [2019-12-27 06:14:57,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b0fd816/b5d496261f8d4c6fb204e71c3edacff9 [2019-12-27 06:14:57,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:14:57,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:14:57,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:14:57,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:14:57,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:14:57,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:57" (1/1) ... [2019-12-27 06:14:57,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81a7e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:57, skipping insertion in model container [2019-12-27 06:14:57,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:57" (1/1) ... [2019-12-27 06:14:57,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:14:57,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:14:57,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:14:57,897 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:14:57,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:14:58,059 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:14:58,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58 WrapperNode [2019-12-27 06:14:58,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:14:58,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:14:58,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:14:58,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:14: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 06:14:58" (1/1) ... [2019-12-27 06:14:58,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:14:58,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:14:58,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:14:58,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:14:58,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (1/1) ... [2019-12-27 06:14:58,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:14:58,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:14:58,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:14:58,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:14:58,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14: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 06:14:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:14:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:14:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:14:58,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:14:58,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:14:58,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:14:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:14:58,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:14:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:14:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:14:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:14:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:14:58,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:14:58,235 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 06:14:58,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:14:58,924 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:14:58,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:58 BoogieIcfgContainer [2019-12-27 06:14:58,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:14:58,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:14:58,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:14:58,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:14:58,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:14:57" (1/3) ... [2019-12-27 06:14:58,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3d9359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:58, skipping insertion in model container [2019-12-27 06:14:58,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:58" (2/3) ... [2019-12-27 06:14:58,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3d9359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:58, skipping insertion in model container [2019-12-27 06:14:58,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:58" (3/3) ... [2019-12-27 06:14:58,937 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt.i [2019-12-27 06:14:58,948 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:14:58,949 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:14:58,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:14:58,964 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:14:59,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,022 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,077 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:59,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:14:59,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:14:59,136 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:14:59,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:14:59,136 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:14:59,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:14:59,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:14:59,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:14:59,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:14:59,153 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-27 06:14:59,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 06:14:59,247 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 06:14:59,248 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:14:59,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:14:59,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 06:14:59,366 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 06:14:59,367 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:14:59,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:14:59,391 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 06:14:59,392 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:15:02,227 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-12-27 06:15:02,913 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 06:15:03,054 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 06:15:03,092 INFO L206 etLargeBlockEncoding]: Checked pairs total: 43881 [2019-12-27 06:15:03,093 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:15:03,096 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 83 transitions [2019-12-27 06:15:03,967 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-27 06:15:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-27 06:15:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:15:03,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:03,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:03,978 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 06:15:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1633137599, now seen corresponding path program 1 times [2019-12-27 06:15:03,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:03,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615898167] [2019-12-27 06:15:03,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:04,347 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 06:15:04,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615898167] [2019-12-27 06:15:04,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:04,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:15:04,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670398460] [2019-12-27 06:15:04,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:04,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:04,375 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-27 06:15:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:04,756 INFO L93 Difference]: Finished difference Result 13112 states and 50889 transitions. [2019-12-27 06:15:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:04,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:15:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:04,910 INFO L225 Difference]: With dead ends: 13112 [2019-12-27 06:15:04,910 INFO L226 Difference]: Without dead ends: 12332 [2019-12-27 06:15:04,913 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 06:15:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12332 states. [2019-12-27 06:15:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12332 to 12332. [2019-12-27 06:15:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12332 states. [2019-12-27 06:15:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12332 states to 12332 states and 47787 transitions. [2019-12-27 06:15:05,675 INFO L78 Accepts]: Start accepts. Automaton has 12332 states and 47787 transitions. Word has length 7 [2019-12-27 06:15:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:05,676 INFO L462 AbstractCegarLoop]: Abstraction has 12332 states and 47787 transitions. [2019-12-27 06:15:05,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 12332 states and 47787 transitions. [2019-12-27 06:15:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:15:05,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:05,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:05,682 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 06:15:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -812909038, now seen corresponding path program 1 times [2019-12-27 06:15:05,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:05,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892696446] [2019-12-27 06:15:05,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:05,737 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 06:15:05,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892696446] [2019-12-27 06:15:05,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:05,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:05,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275592929] [2019-12-27 06:15:05,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:05,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:05,741 INFO L87 Difference]: Start difference. First operand 12332 states and 47787 transitions. Second operand 3 states. [2019-12-27 06:15:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:05,879 INFO L93 Difference]: Finished difference Result 7395 states and 25096 transitions. [2019-12-27 06:15:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:05,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:15:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:05,927 INFO L225 Difference]: With dead ends: 7395 [2019-12-27 06:15:05,927 INFO L226 Difference]: Without dead ends: 7395 [2019-12-27 06:15:05,929 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 06:15:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2019-12-27 06:15:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 7395. [2019-12-27 06:15:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7395 states. [2019-12-27 06:15:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 25096 transitions. [2019-12-27 06:15:07,021 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 25096 transitions. Word has length 13 [2019-12-27 06:15:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,022 INFO L462 AbstractCegarLoop]: Abstraction has 7395 states and 25096 transitions. [2019-12-27 06:15:07,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 25096 transitions. [2019-12-27 06:15:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:15:07,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:07,026 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 06:15:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1068045656, now seen corresponding path program 1 times [2019-12-27 06:15:07,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207874152] [2019-12-27 06:15:07,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,111 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 06:15:07,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207874152] [2019-12-27 06:15:07,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:07,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263219552] [2019-12-27 06:15:07,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:07,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:07,115 INFO L87 Difference]: Start difference. First operand 7395 states and 25096 transitions. Second operand 4 states. [2019-12-27 06:15:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:07,165 INFO L93 Difference]: Finished difference Result 1726 states and 4713 transitions. [2019-12-27 06:15:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:07,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:15:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:07,171 INFO L225 Difference]: With dead ends: 1726 [2019-12-27 06:15:07,172 INFO L226 Difference]: Without dead ends: 1726 [2019-12-27 06:15:07,172 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 06:15:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-27 06:15:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-12-27 06:15:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 06:15:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4713 transitions. [2019-12-27 06:15:07,214 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4713 transitions. Word has length 14 [2019-12-27 06:15:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,214 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 4713 transitions. [2019-12-27 06:15:07,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4713 transitions. [2019-12-27 06:15:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:07,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:07,216 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 06:15:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -902771085, now seen corresponding path program 1 times [2019-12-27 06:15:07,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554447925] [2019-12-27 06:15:07,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,291 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 06:15:07,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554447925] [2019-12-27 06:15:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314520035] [2019-12-27 06:15:07,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:07,297 INFO L87 Difference]: Start difference. First operand 1726 states and 4713 transitions. Second operand 3 states. [2019-12-27 06:15:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:07,369 INFO L93 Difference]: Finished difference Result 2578 states and 7057 transitions. [2019-12-27 06:15:07,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:07,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:15:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:07,379 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 06:15:07,379 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 06:15:07,380 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 06:15:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 06:15:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1996. [2019-12-27 06:15:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-27 06:15:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 5570 transitions. [2019-12-27 06:15:07,439 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 5570 transitions. Word has length 16 [2019-12-27 06:15:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,440 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 5570 transitions. [2019-12-27 06:15:07,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 5570 transitions. [2019-12-27 06:15:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:07,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:07,442 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 06:15:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -807708004, now seen corresponding path program 1 times [2019-12-27 06:15:07,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69318999] [2019-12-27 06:15:07,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,534 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 06:15:07,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69318999] [2019-12-27 06:15:07,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:07,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580838891] [2019-12-27 06:15:07,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:07,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:07,537 INFO L87 Difference]: Start difference. First operand 1996 states and 5570 transitions. Second operand 5 states. [2019-12-27 06:15:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:07,855 INFO L93 Difference]: Finished difference Result 2931 states and 7814 transitions. [2019-12-27 06:15:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:07,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:15:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:07,868 INFO L225 Difference]: With dead ends: 2931 [2019-12-27 06:15:07,868 INFO L226 Difference]: Without dead ends: 2931 [2019-12-27 06:15:07,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-27 06:15:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2477. [2019-12-27 06:15:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-12-27 06:15:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 6729 transitions. [2019-12-27 06:15:07,932 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 6729 transitions. Word has length 16 [2019-12-27 06:15:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,932 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 6729 transitions. [2019-12-27 06:15:07,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 6729 transitions. [2019-12-27 06:15:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:15:07,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:07,938 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 06:15:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1606250141, now seen corresponding path program 1 times [2019-12-27 06:15:07,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481303610] [2019-12-27 06:15:07,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:08,020 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 06:15:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481303610] [2019-12-27 06:15:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274334496] [2019-12-27 06:15:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:08,024 INFO L87 Difference]: Start difference. First operand 2477 states and 6729 transitions. Second operand 5 states. [2019-12-27 06:15:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,056 INFO L93 Difference]: Finished difference Result 1480 states and 4149 transitions. [2019-12-27 06:15:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:08,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 06:15:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,060 INFO L225 Difference]: With dead ends: 1480 [2019-12-27 06:15:08,061 INFO L226 Difference]: Without dead ends: 1480 [2019-12-27 06:15:08,062 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 06:15:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-27 06:15:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1432. [2019-12-27 06:15:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-12-27 06:15:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 4029 transitions. [2019-12-27 06:15:08,094 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 4029 transitions. Word has length 29 [2019-12-27 06:15:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:08,095 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 4029 transitions. [2019-12-27 06:15:08,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 4029 transitions. [2019-12-27 06:15:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:08,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:08,101 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] [2019-12-27 06:15:08,101 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 06:15:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2141548715, now seen corresponding path program 1 times [2019-12-27 06:15:08,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:08,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881099876] [2019-12-27 06:15:08,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:08,298 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 06:15:08,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881099876] [2019-12-27 06:15:08,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:08,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:08,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777967457] [2019-12-27 06:15:08,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:08,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:08,303 INFO L87 Difference]: Start difference. First operand 1432 states and 4029 transitions. Second operand 4 states. [2019-12-27 06:15:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,329 INFO L93 Difference]: Finished difference Result 2017 states and 5395 transitions. [2019-12-27 06:15:08,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:08,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 06:15:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,335 INFO L225 Difference]: With dead ends: 2017 [2019-12-27 06:15:08,335 INFO L226 Difference]: Without dead ends: 1290 [2019-12-27 06:15:08,335 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 06:15:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-27 06:15:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-12-27 06:15:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-12-27 06:15:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3570 transitions. [2019-12-27 06:15:08,362 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3570 transitions. Word has length 44 [2019-12-27 06:15:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:08,364 INFO L462 AbstractCegarLoop]: Abstraction has 1290 states and 3570 transitions. [2019-12-27 06:15:08,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3570 transitions. [2019-12-27 06:15:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:08,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:08,370 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] [2019-12-27 06:15:08,370 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 06:15:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1012376631, now seen corresponding path program 2 times [2019-12-27 06:15:08,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:08,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222452262] [2019-12-27 06:15:08,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:08,455 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 06:15:08,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222452262] [2019-12-27 06:15:08,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:08,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:08,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486830138] [2019-12-27 06:15:08,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:08,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:08,458 INFO L87 Difference]: Start difference. First operand 1290 states and 3570 transitions. Second operand 3 states. [2019-12-27 06:15:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,475 INFO L93 Difference]: Finished difference Result 1699 states and 4565 transitions. [2019-12-27 06:15:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:08,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:15:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,477 INFO L225 Difference]: With dead ends: 1699 [2019-12-27 06:15:08,478 INFO L226 Difference]: Without dead ends: 441 [2019-12-27 06:15:08,478 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 06:15:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-27 06:15:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-12-27 06:15:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-27 06:15:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1050 transitions. [2019-12-27 06:15:08,487 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1050 transitions. Word has length 44 [2019-12-27 06:15:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:08,487 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 1050 transitions. [2019-12-27 06:15:08,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1050 transitions. [2019-12-27 06:15:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:08,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:08,489 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] [2019-12-27 06:15:08,489 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 06:15:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1658366409, now seen corresponding path program 3 times [2019-12-27 06:15:08,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:08,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707802984] [2019-12-27 06:15:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:08,572 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 06:15:08,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707802984] [2019-12-27 06:15:08,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:08,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:08,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435156460] [2019-12-27 06:15:08,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:08,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:08,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:08,576 INFO L87 Difference]: Start difference. First operand 441 states and 1050 transitions. Second operand 5 states. [2019-12-27 06:15:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,899 INFO L93 Difference]: Finished difference Result 802 states and 1822 transitions. [2019-12-27 06:15:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:15:08,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 06:15:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,902 INFO L225 Difference]: With dead ends: 802 [2019-12-27 06:15:08,902 INFO L226 Difference]: Without dead ends: 802 [2019-12-27 06:15:08,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-27 06:15:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 758. [2019-12-27 06:15:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 06:15:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1732 transitions. [2019-12-27 06:15:08,917 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1732 transitions. Word has length 44 [2019-12-27 06:15:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:08,918 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1732 transitions. [2019-12-27 06:15:08,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1732 transitions. [2019-12-27 06:15:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:08,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:08,920 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] [2019-12-27 06:15:08,921 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 06:15:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 616615367, now seen corresponding path program 4 times [2019-12-27 06:15:08,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:08,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643353459] [2019-12-27 06:15:08,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:09,013 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 06:15:09,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643353459] [2019-12-27 06:15:09,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:09,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:09,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822367569] [2019-12-27 06:15:09,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:09,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:09,016 INFO L87 Difference]: Start difference. First operand 758 states and 1732 transitions. Second operand 7 states. [2019-12-27 06:15:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:09,250 INFO L93 Difference]: Finished difference Result 1956 states and 4215 transitions. [2019-12-27 06:15:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:15:09,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 06:15:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:09,253 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 06:15:09,253 INFO L226 Difference]: Without dead ends: 1269 [2019-12-27 06:15:09,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:15:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-12-27 06:15:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 796. [2019-12-27 06:15:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-27 06:15:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1792 transitions. [2019-12-27 06:15:09,271 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1792 transitions. Word has length 44 [2019-12-27 06:15:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:09,271 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1792 transitions. [2019-12-27 06:15:09,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1792 transitions. [2019-12-27 06:15:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:09,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:09,274 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] [2019-12-27 06:15:09,274 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 06:15:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1634630491, now seen corresponding path program 5 times [2019-12-27 06:15:09,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:09,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479815336] [2019-12-27 06:15:09,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:09,480 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 06:15:09,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479815336] [2019-12-27 06:15:09,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:09,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:15:09,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750632995] [2019-12-27 06:15:09,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:15:09,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:09,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:15:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:09,518 INFO L87 Difference]: Start difference. First operand 796 states and 1792 transitions. Second operand 10 states. [2019-12-27 06:15:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:10,676 INFO L93 Difference]: Finished difference Result 1193 states and 2419 transitions. [2019-12-27 06:15:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:15:10,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-12-27 06:15:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:10,679 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:15:10,679 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:15:10,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:15:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:15:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 637. [2019-12-27 06:15:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-12-27 06:15:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1322 transitions. [2019-12-27 06:15:10,695 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1322 transitions. Word has length 44 [2019-12-27 06:15:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:10,695 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 1322 transitions. [2019-12-27 06:15:10,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:15:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1322 transitions. [2019-12-27 06:15:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:10,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:10,697 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] [2019-12-27 06:15:10,697 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 06:15:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 674280567, now seen corresponding path program 6 times [2019-12-27 06:15:10,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:10,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100395082] [2019-12-27 06:15:10,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:10,787 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 06:15:10,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100395082] [2019-12-27 06:15:10,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:10,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:10,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268377149] [2019-12-27 06:15:10,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:10,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:10,789 INFO L87 Difference]: Start difference. First operand 637 states and 1322 transitions. Second operand 7 states. [2019-12-27 06:15:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:11,384 INFO L93 Difference]: Finished difference Result 1011 states and 2013 transitions. [2019-12-27 06:15:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:15:11,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 06:15:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:11,390 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 06:15:11,390 INFO L226 Difference]: Without dead ends: 1011 [2019-12-27 06:15:11,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-27 06:15:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 694. [2019-12-27 06:15:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-27 06:15:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1403 transitions. [2019-12-27 06:15:11,412 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1403 transitions. Word has length 44 [2019-12-27 06:15:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:11,412 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1403 transitions. [2019-12-27 06:15:11,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1403 transitions. [2019-12-27 06:15:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:15:11,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:11,415 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] [2019-12-27 06:15:11,415 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 06:15:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2029606575, now seen corresponding path program 7 times [2019-12-27 06:15:11,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:11,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14090062] [2019-12-27 06:15:11,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:11,537 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 06:15:11,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14090062] [2019-12-27 06:15:11,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:11,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554953675] [2019-12-27 06:15:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:11,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:11,541 INFO L87 Difference]: Start difference. First operand 694 states and 1403 transitions. Second operand 3 states. [2019-12-27 06:15:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:11,555 INFO L93 Difference]: Finished difference Result 692 states and 1398 transitions. [2019-12-27 06:15:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:11,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:15:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:11,557 INFO L225 Difference]: With dead ends: 692 [2019-12-27 06:15:11,557 INFO L226 Difference]: Without dead ends: 692 [2019-12-27 06:15:11,557 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 06:15:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-27 06:15:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 602. [2019-12-27 06:15:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 06:15:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1234 transitions. [2019-12-27 06:15:11,570 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1234 transitions. Word has length 44 [2019-12-27 06:15:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:11,570 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1234 transitions. [2019-12-27 06:15:11,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1234 transitions. [2019-12-27 06:15:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:15:11,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:11,572 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] [2019-12-27 06:15:11,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 759529029, now seen corresponding path program 1 times [2019-12-27 06:15:11,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:11,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453932477] [2019-12-27 06:15:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:11,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:15:11,771 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:15:11,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~z$w_buff1_used~0_56) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_19) (= 0 v_~z$r_buff1_thd2~0_39) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t888~0.base_30|)) (= 0 v_~y~0_7) (= v_~z$r_buff0_thd2~0_68 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~z$read_delayed_var~0.offset_5 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t888~0.base_30|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_30|) |v_ULTIMATE.start_main_~#t888~0.offset_21| 0)) |v_#memory_int_21|) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$w_buff0_used~0_93 0) (= v_~z$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= v_~z$r_buff0_thd3~0_27 0) (= |v_ULTIMATE.start_main_~#t888~0.offset_21| 0) (= v_~main$tmp_guard1~0_15 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t888~0.base_30| 4) |v_#length_25|) (= 0 v_~z$flush_delayed~0_12) (= v_~__unbuffered_p2_EBX~0_17 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~z$w_buff0~0_26) (= v_~z~0_20 0) (= 0 v_~z$w_buff1~0_24) (= v_~b~0_12 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t888~0.base_30| 1)) (= v_~x~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start_main_~#t888~0.offset=|v_ULTIMATE.start_main_~#t888~0.offset_21|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ULTIMATE.start_main_~#t888~0.base=|v_ULTIMATE.start_main_~#t888~0.base_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_68, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t888~0.offset, ULTIMATE.start_main_~#t890~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t889~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t888~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t890~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t889~0.offset, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:15:11,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L830-1-->L832: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t889~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t889~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11|) |v_ULTIMATE.start_main_~#t889~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t889~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t889~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t889~0.base, #length, ULTIMATE.start_main_~#t889~0.offset] because there is no mapped edge [2019-12-27 06:15:11,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L832-1-->L834: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13|) |v_ULTIMATE.start_main_~#t890~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t890~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t890~0.base_13| 0)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13|)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t890~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t890~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t890~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t890~0.offset] because there is no mapped edge [2019-12-27 06:15:11,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= 1 v_~a~0_4) (= v_~z$r_buff0_thd2~0_45 v_~z$r_buff1_thd2~0_26) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd3~0_22 v_~z$r_buff1_thd3~0_12) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~__unbuffered_p2_EBX~0_5 v_~b~0_5) (= v_~__unbuffered_p2_EAX~0_5 v_~a~0_4) (= v_~z$r_buff0_thd3~0_21 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_26, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~a~0=v_~a~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-27 06:15:11,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:15:11,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1754963220 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1754963220 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1754963220 256)) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-1754963220 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1754963220 256))))) (= |P1Thread1of1ForFork1_#t~ite15_Out-1754963220| |P1Thread1of1ForFork1_#t~ite14_Out-1754963220|) (= |P1Thread1of1ForFork1_#t~ite14_Out-1754963220| ~z$w_buff0_used~0_In-1754963220)) (and (= |P1Thread1of1ForFork1_#t~ite14_In-1754963220| |P1Thread1of1ForFork1_#t~ite14_Out-1754963220|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1754963220| ~z$w_buff0_used~0_In-1754963220)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1754963220, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1754963220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1754963220, ~weak$$choice2~0=~weak$$choice2~0_In-1754963220, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1754963220, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1754963220|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1754963220, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1754963220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1754963220, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1754963220|, ~weak$$choice2~0=~weak$$choice2~0_In-1754963220, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1754963220|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1754963220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:15:11,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_59 v_~z$r_buff0_thd2~0_58)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:15:11,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 06:15:11,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In667637634 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In667637634 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out667637634| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out667637634| ~z$w_buff0_used~0_In667637634)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In667637634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In667637634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In667637634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In667637634, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out667637634|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:15:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1563617816 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1563617816 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1563617816 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1563617816 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out1563617816| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite29_Out1563617816| ~z$w_buff1_used~0_In1563617816) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1563617816, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1563617816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1563617816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1563617816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1563617816, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1563617816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1563617816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1563617816, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1563617816|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:15:11,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1553726138 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1553726138 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out1553726138)) (and (= ~z$r_buff0_thd3~0_In1553726138 ~z$r_buff0_thd3~0_Out1553726138) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1553726138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1553726138} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1553726138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1553726138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1553726138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:15:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1459539925 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1459539925 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1459539925 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1459539925 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1459539925|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1459539925 |P2Thread1of1ForFork2_#t~ite31_Out1459539925|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1459539925, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1459539925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1459539925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1459539925} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1459539925|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459539925, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1459539925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1459539925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1459539925} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:15:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd3~0_15)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:15:11,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:15:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1178615606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1178615606 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1178615606| ~z$w_buff1~0_In1178615606) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1178615606| ~z~0_In1178615606)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1178615606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1178615606, ~z$w_buff1~0=~z$w_buff1~0_In1178615606, ~z~0=~z~0_In1178615606} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1178615606, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1178615606|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1178615606, ~z$w_buff1~0=~z$w_buff1~0_In1178615606, ~z~0=~z~0_In1178615606} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 06:15:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-27 06:15:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1274015490 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1274015490 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1274015490| ~z$w_buff0_used~0_In1274015490)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out1274015490|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1274015490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1274015490} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1274015490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1274015490, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1274015490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:15:11,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1996632820 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1996632820 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1996632820 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1996632820 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1996632820| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1996632820| ~z$w_buff1_used~0_In-1996632820)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1996632820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1996632820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1996632820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1996632820} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1996632820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1996632820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1996632820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1996632820, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1996632820|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:15:11,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In17336703 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In17336703 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out17336703|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In17336703 |ULTIMATE.start_main_#t~ite39_Out17336703|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In17336703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In17336703} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In17336703, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out17336703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In17336703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:15:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2067633839 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2067633839 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In2067633839 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In2067633839 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out2067633839|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In2067633839 |ULTIMATE.start_main_#t~ite40_Out2067633839|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2067633839, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2067633839, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2067633839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2067633839} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2067633839, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2067633839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2067633839, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2067633839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2067633839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:15:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite40_14| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 1 v_~__unbuffered_p1_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 1 v_~__unbuffered_p2_EAX~0_11) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:15:11,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:15:11 BasicIcfg [2019-12-27 06:15:11,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:15:11,942 INFO L168 Benchmark]: Toolchain (without parser) took 14644.17 ms. Allocated memory was 145.2 MB in the beginning and 582.5 MB in the end (delta: 437.3 MB). Free memory was 101.4 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 382.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,945 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:15:11,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.88 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.85 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,952 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,953 INFO L168 Benchmark]: RCFGBuilder took 761.68 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 106.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,953 INFO L168 Benchmark]: TraceAbstraction took 13012.25 ms. Allocated memory was 201.3 MB in the beginning and 582.5 MB in the end (delta: 381.2 MB). Free memory was 106.1 MB in the beginning and 156.7 MB in the end (delta: -50.6 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:11,964 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.17 ms. Allocated memory is still 145.2 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.88 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.85 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.68 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 106.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13012.25 ms. Allocated memory was 201.3 MB in the beginning and 582.5 MB in the end (delta: 381.2 MB). Free memory was 106.1 MB in the beginning and 156.7 MB in the end (delta: -50.6 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 155 ProgramPointsBefore, 73 ProgramPointsAfterwards, 180 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4740 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 43881 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1472 SDtfs, 1603 SDslu, 3017 SDs, 0 SdLazy, 2021 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2564 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 49086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...