/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:05:41,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:05:41,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:05:41,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:05:41,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:05:41,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:05:41,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:05:41,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:05:41,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:05:41,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:05:41,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:05:41,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:05:41,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:05:41,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:05:41,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:05:41,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:05:41,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:05:41,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:05:41,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:05:41,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:05:41,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:05:41,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:05:41,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:05:41,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:05:41,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:05:41,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:05:41,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:05:41,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:05:41,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:05:41,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:05:41,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:05:41,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:05:41,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:05:41,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:05:41,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:05:41,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:05:41,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:05:41,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:05:41,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:05:41,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:05:41,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:05:41,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:05:41,185 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:05:41,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:05:41,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:05:41,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:05:41,187 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:05:41,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:05:41,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:05:41,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:05:41,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:05:41,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:05:41,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:05:41,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:05:41,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:05:41,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:05:41,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:05:41,189 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:05:41,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:05:41,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:05:41,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:05:41,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:05:41,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:05:41,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:05:41,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:05:41,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:05:41,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:05:41,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:05:41,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:05:41,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:05:41,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:05:41,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:05:41,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:05:41,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:05:41,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:05:41,488 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:05:41,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-18 19:05:41,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4eb1cc/0628de840d394da5bb172c99225c4e50/FLAG85372d3ad [2019-12-18 19:05:42,078 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:05:42,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-18 19:05:42,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4eb1cc/0628de840d394da5bb172c99225c4e50/FLAG85372d3ad [2019-12-18 19:05:42,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4eb1cc/0628de840d394da5bb172c99225c4e50 [2019-12-18 19:05:42,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:05:42,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:05:42,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:42,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:05:42,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:05:42,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:42" (1/1) ... [2019-12-18 19:05:42,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497ae45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:42, skipping insertion in model container [2019-12-18 19:05:42,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:42" (1/1) ... [2019-12-18 19:05:42,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:05:42,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:05:43,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:43,065 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:05:43,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:43,231 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:05:43,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43 WrapperNode [2019-12-18 19:05:43,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:43,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:43,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:05:43,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:05:43,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:43,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:05:43,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:05:43,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:05:43,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (1/1) ... [2019-12-18 19:05:43,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:05:43,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:05:43,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:05:43,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:05:43,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (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-18 19:05:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:05:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:05:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:05:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:05:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:05:43,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:05:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:05:43,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:05:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:05:43,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:05:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:05:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:05:43,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:05:43,417 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:05:44,099 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:05:44,099 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:05:44,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:44 BoogieIcfgContainer [2019-12-18 19:05:44,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:05:44,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:05:44,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:05:44,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:05:44,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:05:42" (1/3) ... [2019-12-18 19:05:44,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c812476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:44, skipping insertion in model container [2019-12-18 19:05:44,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:43" (2/3) ... [2019-12-18 19:05:44,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c812476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:44, skipping insertion in model container [2019-12-18 19:05:44,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:44" (3/3) ... [2019-12-18 19:05:44,117 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2019-12-18 19:05:44,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:05:44,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:05:44,144 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:05:44,145 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:05:44,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,249 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,249 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,287 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:44,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:05:44,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:05:44,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:05:44,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:05:44,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:05:44,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:05:44,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:05:44,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:05:44,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:05:44,380 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 19:05:44,382 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:44,482 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:44,483 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:44,507 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:44,533 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:44,601 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:44,602 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:44,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:44,630 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 19:05:44,631 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:05:49,882 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 19:05:50,019 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 19:05:50,043 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-18 19:05:50,043 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 19:05:50,047 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 19:06:01,753 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-18 19:06:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-18 19:06:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:06:01,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:01,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:06:01,761 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-18 19:06:01,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:01,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397296783] [2019-12-18 19:06:01,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:02,007 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-18 19:06:02,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397296783] [2019-12-18 19:06:02,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:02,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:06:02,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809167781] [2019-12-18 19:06:02,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:02,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:02,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:02,027 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-18 19:06:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:04,538 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-18 19:06:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:04,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:06:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:05,059 INFO L225 Difference]: With dead ends: 82272 [2019-12-18 19:06:05,059 INFO L226 Difference]: Without dead ends: 77232 [2019-12-18 19:06:05,061 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-18 19:06:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-18 19:06:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-18 19:06:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-18 19:06:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-18 19:06:15,129 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-18 19:06:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:15,130 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-18 19:06:15,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-18 19:06:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:06:15,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:15,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:15,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-18 19:06:15,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:15,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302970236] [2019-12-18 19:06:15,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:15,314 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-18 19:06:15,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302970236] [2019-12-18 19:06:15,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:15,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:06:15,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169006087] [2019-12-18 19:06:15,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:06:15,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:06:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:06:15,318 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-18 19:06:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:16,190 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-18 19:06:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:06:16,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:06:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:16,712 INFO L225 Difference]: With dead ends: 119112 [2019-12-18 19:06:16,713 INFO L226 Difference]: Without dead ends: 119007 [2019-12-18 19:06:16,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:06:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-18 19:06:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-18 19:06:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-18 19:06:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-18 19:06:28,239 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-18 19:06:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:28,240 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-18 19:06:28,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:06:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-18 19:06:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:06:28,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:28,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:28,244 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-18 19:06:28,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:28,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713120498] [2019-12-18 19:06:28,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:28,338 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-18 19:06:28,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713120498] [2019-12-18 19:06:28,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:28,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:06:28,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275839038] [2019-12-18 19:06:28,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:28,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:28,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:28,340 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-18 19:06:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:28,450 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-18 19:06:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:28,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:06:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:28,509 INFO L225 Difference]: With dead ends: 27724 [2019-12-18 19:06:28,510 INFO L226 Difference]: Without dead ends: 27724 [2019-12-18 19:06:28,510 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-18 19:06:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-18 19:06:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-18 19:06:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-18 19:06:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-18 19:06:29,956 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-18 19:06:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:29,957 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-18 19:06:29,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-18 19:06:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:06:29,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:29,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:29,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-18 19:06:29,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:29,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857293941] [2019-12-18 19:06:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:06:30,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857293941] [2019-12-18 19:06:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:06:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803278330] [2019-12-18 19:06:30,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:06:30,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:06:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:06:30,034 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 5 states. [2019-12-18 19:06:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:30,487 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-18 19:06:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:06:30,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 19:06:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:30,558 INFO L225 Difference]: With dead ends: 40807 [2019-12-18 19:06:30,558 INFO L226 Difference]: Without dead ends: 40789 [2019-12-18 19:06:30,559 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-18 19:06:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-18 19:06:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-18 19:06:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-18 19:06:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-18 19:06:31,951 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-18 19:06:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:31,951 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-18 19:06:31,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:06:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-18 19:06:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:06:31,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:31,961 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] [2019-12-18 19:06:31,961 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-18 19:06:31,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:31,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520902540] [2019-12-18 19:06:31,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:32,063 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-18 19:06:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520902540] [2019-12-18 19:06:32,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:32,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:06:32,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660327832] [2019-12-18 19:06:32,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:06:32,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:06:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:06:32,065 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 6 states. [2019-12-18 19:06:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:32,813 INFO L93 Difference]: Finished difference Result 51183 states and 167445 transitions. [2019-12-18 19:06:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:06:32,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:06:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:32,906 INFO L225 Difference]: With dead ends: 51183 [2019-12-18 19:06:32,906 INFO L226 Difference]: Without dead ends: 51153 [2019-12-18 19:06:32,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:06:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51153 states. [2019-12-18 19:06:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51153 to 34768. [2019-12-18 19:06:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34768 states. [2019-12-18 19:06:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34768 states to 34768 states and 115556 transitions. [2019-12-18 19:06:34,299 INFO L78 Accepts]: Start accepts. Automaton has 34768 states and 115556 transitions. Word has length 22 [2019-12-18 19:06:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:34,299 INFO L462 AbstractCegarLoop]: Abstraction has 34768 states and 115556 transitions. [2019-12-18 19:06:34,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:06:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34768 states and 115556 transitions. [2019-12-18 19:06:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:06:34,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:34,309 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] [2019-12-18 19:06:34,309 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:34,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-18 19:06:34,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:34,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78551881] [2019-12-18 19:06:34,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:34,389 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-18 19:06:34,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78551881] [2019-12-18 19:06:34,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:34,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:06:34,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255935656] [2019-12-18 19:06:34,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:06:34,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:06:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:06:34,392 INFO L87 Difference]: Start difference. First operand 34768 states and 115556 transitions. Second operand 6 states. [2019-12-18 19:06:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:35,227 INFO L93 Difference]: Finished difference Result 51553 states and 167314 transitions. [2019-12-18 19:06:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:06:35,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:06:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:35,320 INFO L225 Difference]: With dead ends: 51553 [2019-12-18 19:06:35,320 INFO L226 Difference]: Without dead ends: 51523 [2019-12-18 19:06:35,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:06:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51523 states. [2019-12-18 19:06:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51523 to 36074. [2019-12-18 19:06:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36074 states. [2019-12-18 19:06:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36074 states to 36074 states and 118567 transitions. [2019-12-18 19:06:36,728 INFO L78 Accepts]: Start accepts. Automaton has 36074 states and 118567 transitions. Word has length 22 [2019-12-18 19:06:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:36,728 INFO L462 AbstractCegarLoop]: Abstraction has 36074 states and 118567 transitions. [2019-12-18 19:06:36,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:06:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36074 states and 118567 transitions. [2019-12-18 19:06:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:06:36,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:36,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:36,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-18 19:06:36,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:36,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789481918] [2019-12-18 19:06:36,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:36,798 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-18 19:06:36,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789481918] [2019-12-18 19:06:36,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:36,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:06:36,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512954690] [2019-12-18 19:06:36,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:06:36,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:06:36,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:06:36,800 INFO L87 Difference]: Start difference. First operand 36074 states and 118567 transitions. Second operand 4 states. [2019-12-18 19:06:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:36,864 INFO L93 Difference]: Finished difference Result 14149 states and 43172 transitions. [2019-12-18 19:06:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:06:36,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 19:06:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:36,884 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 19:06:36,884 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 19:06:36,885 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-18 19:06:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 19:06:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 13955. [2019-12-18 19:06:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13955 states. [2019-12-18 19:06:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 42611 transitions. [2019-12-18 19:06:37,090 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 42611 transitions. Word has length 25 [2019-12-18 19:06:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:37,090 INFO L462 AbstractCegarLoop]: Abstraction has 13955 states and 42611 transitions. [2019-12-18 19:06:37,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:06:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 42611 transitions. [2019-12-18 19:06:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 19:06:37,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:37,110 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] [2019-12-18 19:06:37,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-18 19:06:37,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:37,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326569494] [2019-12-18 19:06:37,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:37,172 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-18 19:06:37,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326569494] [2019-12-18 19:06:37,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:37,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:06:37,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233853295] [2019-12-18 19:06:37,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:37,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:37,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:37,174 INFO L87 Difference]: Start difference. First operand 13955 states and 42611 transitions. Second operand 3 states. [2019-12-18 19:06:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:37,284 INFO L93 Difference]: Finished difference Result 25821 states and 78709 transitions. [2019-12-18 19:06:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:37,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 19:06:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:37,311 INFO L225 Difference]: With dead ends: 25821 [2019-12-18 19:06:37,311 INFO L226 Difference]: Without dead ends: 14420 [2019-12-18 19:06:37,312 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-18 19:06:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14420 states. [2019-12-18 19:06:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14420 to 14287. [2019-12-18 19:06:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14287 states. [2019-12-18 19:06:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 42676 transitions. [2019-12-18 19:06:37,547 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 42676 transitions. Word has length 39 [2019-12-18 19:06:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:37,547 INFO L462 AbstractCegarLoop]: Abstraction has 14287 states and 42676 transitions. [2019-12-18 19:06:37,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 42676 transitions. [2019-12-18 19:06:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 19:06:37,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:37,568 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] [2019-12-18 19:06:37,569 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-18 19:06:37,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:37,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251402837] [2019-12-18 19:06:37,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:37,636 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-18 19:06:37,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251402837] [2019-12-18 19:06:37,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:37,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:06:37,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528455581] [2019-12-18 19:06:37,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:06:37,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:37,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:06:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:06:37,638 INFO L87 Difference]: Start difference. First operand 14287 states and 42676 transitions. Second operand 5 states. [2019-12-18 19:06:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:37,722 INFO L93 Difference]: Finished difference Result 12923 states and 39241 transitions. [2019-12-18 19:06:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:06:37,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 19:06:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:37,746 INFO L225 Difference]: With dead ends: 12923 [2019-12-18 19:06:37,746 INFO L226 Difference]: Without dead ends: 10951 [2019-12-18 19:06:37,747 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-18 19:06:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2019-12-18 19:06:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 10573. [2019-12-18 19:06:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10573 states. [2019-12-18 19:06:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 32791 transitions. [2019-12-18 19:06:37,946 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 32791 transitions. Word has length 40 [2019-12-18 19:06:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:37,946 INFO L462 AbstractCegarLoop]: Abstraction has 10573 states and 32791 transitions. [2019-12-18 19:06:37,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:06:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 32791 transitions. [2019-12-18 19:06:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:37,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:37,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:37,962 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:37,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 917917389, now seen corresponding path program 1 times [2019-12-18 19:06:37,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:37,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554546621] [2019-12-18 19:06:37,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:38,034 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-18 19:06:38,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554546621] [2019-12-18 19:06:38,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:38,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:06:38,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132273218] [2019-12-18 19:06:38,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:38,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:38,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:38,037 INFO L87 Difference]: Start difference. First operand 10573 states and 32791 transitions. Second operand 3 states. [2019-12-18 19:06:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:39,051 INFO L93 Difference]: Finished difference Result 14303 states and 43654 transitions. [2019-12-18 19:06:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:39,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:06:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:39,083 INFO L225 Difference]: With dead ends: 14303 [2019-12-18 19:06:39,083 INFO L226 Difference]: Without dead ends: 14303 [2019-12-18 19:06:39,083 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-18 19:06:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-18 19:06:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 11263. [2019-12-18 19:06:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11263 states. [2019-12-18 19:06:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 34861 transitions. [2019-12-18 19:06:39,372 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 34861 transitions. Word has length 54 [2019-12-18 19:06:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:39,373 INFO L462 AbstractCegarLoop]: Abstraction has 11263 states and 34861 transitions. [2019-12-18 19:06:39,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 34861 transitions. [2019-12-18 19:06:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:39,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:39,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:39,400 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-18 19:06:39,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:39,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009842045] [2019-12-18 19:06:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:39,552 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-18 19:06:39,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009842045] [2019-12-18 19:06:39,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:39,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:06:39,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277306264] [2019-12-18 19:06:39,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:06:39,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:06:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:06:39,558 INFO L87 Difference]: Start difference. First operand 11263 states and 34861 transitions. Second operand 6 states. [2019-12-18 19:06:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:40,018 INFO L93 Difference]: Finished difference Result 33207 states and 101689 transitions. [2019-12-18 19:06:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:06:40,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 19:06:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:40,064 INFO L225 Difference]: With dead ends: 33207 [2019-12-18 19:06:40,065 INFO L226 Difference]: Without dead ends: 23787 [2019-12-18 19:06:40,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:06:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23787 states. [2019-12-18 19:06:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23787 to 13957. [2019-12-18 19:06:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13957 states. [2019-12-18 19:06:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13957 states to 13957 states and 43447 transitions. [2019-12-18 19:06:40,402 INFO L78 Accepts]: Start accepts. Automaton has 13957 states and 43447 transitions. Word has length 54 [2019-12-18 19:06:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:40,403 INFO L462 AbstractCegarLoop]: Abstraction has 13957 states and 43447 transitions. [2019-12-18 19:06:40,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:06:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13957 states and 43447 transitions. [2019-12-18 19:06:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:40,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:40,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:40,419 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:40,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-18 19:06:40,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:40,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854073361] [2019-12-18 19:06:40,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:40,516 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-18 19:06:40,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854073361] [2019-12-18 19:06:40,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:40,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:06:40,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364338796] [2019-12-18 19:06:40,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:06:40,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:06:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:06:40,518 INFO L87 Difference]: Start difference. First operand 13957 states and 43447 transitions. Second operand 7 states. [2019-12-18 19:06:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:40,933 INFO L93 Difference]: Finished difference Result 33199 states and 101841 transitions. [2019-12-18 19:06:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:06:40,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:06:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:40,973 INFO L225 Difference]: With dead ends: 33199 [2019-12-18 19:06:40,973 INFO L226 Difference]: Without dead ends: 25551 [2019-12-18 19:06:40,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:06:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25551 states. [2019-12-18 19:06:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25551 to 16624. [2019-12-18 19:06:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-12-18 19:06:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 51830 transitions. [2019-12-18 19:06:41,447 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 51830 transitions. Word has length 54 [2019-12-18 19:06:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:41,448 INFO L462 AbstractCegarLoop]: Abstraction has 16624 states and 51830 transitions. [2019-12-18 19:06:41,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:06:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 51830 transitions. [2019-12-18 19:06:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:41,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:41,467 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-18 19:06:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954087097] [2019-12-18 19:06:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:41,585 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-18 19:06:41,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954087097] [2019-12-18 19:06:41,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:41,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:06:41,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314014112] [2019-12-18 19:06:41,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:06:41,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:06:41,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:06:41,587 INFO L87 Difference]: Start difference. First operand 16624 states and 51830 transitions. Second operand 7 states. [2019-12-18 19:06:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:41,995 INFO L93 Difference]: Finished difference Result 29813 states and 90433 transitions. [2019-12-18 19:06:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:06:41,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:06:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:42,037 INFO L225 Difference]: With dead ends: 29813 [2019-12-18 19:06:42,038 INFO L226 Difference]: Without dead ends: 27722 [2019-12-18 19:06:42,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:06:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27722 states. [2019-12-18 19:06:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27722 to 16706. [2019-12-18 19:06:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 19:06:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 52124 transitions. [2019-12-18 19:06:42,385 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 52124 transitions. Word has length 54 [2019-12-18 19:06:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:42,385 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 52124 transitions. [2019-12-18 19:06:42,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:06:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 52124 transitions. [2019-12-18 19:06:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:42,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:42,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:42,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-18 19:06:42,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:42,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889031814] [2019-12-18 19:06:42,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:42,452 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-18 19:06:42,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889031814] [2019-12-18 19:06:42,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:42,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:06:42,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644007884] [2019-12-18 19:06:42,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:42,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:42,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:42,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:42,454 INFO L87 Difference]: Start difference. First operand 16706 states and 52124 transitions. Second operand 3 states. [2019-12-18 19:06:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:42,556 INFO L93 Difference]: Finished difference Result 18535 states and 56308 transitions. [2019-12-18 19:06:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:42,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:06:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:42,591 INFO L225 Difference]: With dead ends: 18535 [2019-12-18 19:06:42,591 INFO L226 Difference]: Without dead ends: 18535 [2019-12-18 19:06:42,592 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-18 19:06:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2019-12-18 19:06:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 15978. [2019-12-18 19:06:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15978 states. [2019-12-18 19:06:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15978 states to 15978 states and 49163 transitions. [2019-12-18 19:06:42,860 INFO L78 Accepts]: Start accepts. Automaton has 15978 states and 49163 transitions. Word has length 54 [2019-12-18 19:06:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:42,861 INFO L462 AbstractCegarLoop]: Abstraction has 15978 states and 49163 transitions. [2019-12-18 19:06:42,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15978 states and 49163 transitions. [2019-12-18 19:06:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:42,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:42,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:42,882 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-18 19:06:42,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:42,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545178969] [2019-12-18 19:06:42,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:42,954 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-18 19:06:42,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545178969] [2019-12-18 19:06:42,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:42,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:06:42,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540265086] [2019-12-18 19:06:42,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:06:42,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:06:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:06:42,956 INFO L87 Difference]: Start difference. First operand 15978 states and 49163 transitions. Second operand 7 states. [2019-12-18 19:06:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:43,431 INFO L93 Difference]: Finished difference Result 31956 states and 95510 transitions. [2019-12-18 19:06:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:06:43,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 19:06:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:43,468 INFO L225 Difference]: With dead ends: 31956 [2019-12-18 19:06:43,468 INFO L226 Difference]: Without dead ends: 26966 [2019-12-18 19:06:43,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:06:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26966 states. [2019-12-18 19:06:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26966 to 16134. [2019-12-18 19:06:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16134 states. [2019-12-18 19:06:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 49593 transitions. [2019-12-18 19:06:43,794 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 49593 transitions. Word has length 54 [2019-12-18 19:06:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:43,794 INFO L462 AbstractCegarLoop]: Abstraction has 16134 states and 49593 transitions. [2019-12-18 19:06:43,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:06:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 49593 transitions. [2019-12-18 19:06:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:06:43,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:43,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:43,810 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-18 19:06:43,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:43,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500369440] [2019-12-18 19:06:43,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:06:43,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500369440] [2019-12-18 19:06:43,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:43,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:06:43,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745705975] [2019-12-18 19:06:43,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:43,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:43,885 INFO L87 Difference]: Start difference. First operand 16134 states and 49593 transitions. Second operand 3 states. [2019-12-18 19:06:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:43,938 INFO L93 Difference]: Finished difference Result 12976 states and 38987 transitions. [2019-12-18 19:06:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:43,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 19:06:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:43,957 INFO L225 Difference]: With dead ends: 12976 [2019-12-18 19:06:43,957 INFO L226 Difference]: Without dead ends: 12976 [2019-12-18 19:06:43,957 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-18 19:06:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2019-12-18 19:06:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 12502. [2019-12-18 19:06:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12502 states. [2019-12-18 19:06:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12502 states to 12502 states and 37525 transitions. [2019-12-18 19:06:44,150 INFO L78 Accepts]: Start accepts. Automaton has 12502 states and 37525 transitions. Word has length 54 [2019-12-18 19:06:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:44,150 INFO L462 AbstractCegarLoop]: Abstraction has 12502 states and 37525 transitions. [2019-12-18 19:06:44,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12502 states and 37525 transitions. [2019-12-18 19:06:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:06:44,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:44,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:44,164 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-18 19:06:44,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:44,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843360392] [2019-12-18 19:06:44,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:06:44,264 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-18 19:06:44,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843360392] [2019-12-18 19:06:44,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:06:44,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:06:44,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735688739] [2019-12-18 19:06:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:06:44,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:06:44,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:06:44,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:06:44,267 INFO L87 Difference]: Start difference. First operand 12502 states and 37525 transitions. Second operand 3 states. [2019-12-18 19:06:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:06:44,322 INFO L93 Difference]: Finished difference Result 12502 states and 37523 transitions. [2019-12-18 19:06:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:06:44,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 19:06:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:06:44,345 INFO L225 Difference]: With dead ends: 12502 [2019-12-18 19:06:44,345 INFO L226 Difference]: Without dead ends: 12502 [2019-12-18 19:06:44,346 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-18 19:06:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12502 states. [2019-12-18 19:06:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12502 to 10981. [2019-12-18 19:06:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-18 19:06:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 33292 transitions. [2019-12-18 19:06:44,516 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 33292 transitions. Word has length 55 [2019-12-18 19:06:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:06:44,517 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 33292 transitions. [2019-12-18 19:06:44,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:06:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 33292 transitions. [2019-12-18 19:06:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:06:44,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:06:44,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:06:44,528 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:06:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:06:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-18 19:06:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:06:44,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158088979] [2019-12-18 19:06:44,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:06:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:06:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:06:44,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:06:44,673 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:06:44,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= v_~main$tmp_guard0~0_19 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30| 1)) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30|) |v_ULTIMATE.start_main_~#t2525~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30|) 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2525~0.base_30| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2525~0.base_30|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 19:06:44,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 19:06:44,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 19:06:44,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-18 19:06:44,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2037333191 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2037333191 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out2037333191| ~x$w_buff1~0_In2037333191)) (and (= ~x~0_In2037333191 |P2Thread1of1ForFork1_#t~ite32_Out2037333191|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2037333191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2037333191, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2037333191, ~x~0=~x~0_In2037333191} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out2037333191|, ~x$w_buff1~0=~x$w_buff1~0_In2037333191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2037333191, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2037333191, ~x~0=~x~0_In2037333191} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 19:06:44,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 19:06:44,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In937436491 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In937436491 256) 0))) (or (and (= ~x$w_buff0_used~0_In937436491 |P2Thread1of1ForFork1_#t~ite34_Out937436491|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out937436491| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In937436491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937436491} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out937436491|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In937436491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937436491} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 19:06:44,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1326777436 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1326777436 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1326777436 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1326777436 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1326777436 |P2Thread1of1ForFork1_#t~ite35_Out-1326777436|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1326777436|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1326777436, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1326777436, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1326777436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1326777436} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1326777436|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1326777436, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1326777436, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1326777436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1326777436} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 19:06:44,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1378568153 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1378568153 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1378568153| ~x$r_buff0_thd3~0_In-1378568153) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1378568153| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1378568153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378568153} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1378568153|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1378568153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378568153} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 19:06:44,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-314591139 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-314591139 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-314591139 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-314591139 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-314591139| ~x$r_buff1_thd3~0_In-314591139) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-314591139|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-314591139, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-314591139, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-314591139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314591139} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-314591139|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-314591139, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-314591139, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-314591139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314591139} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 19:06:44,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 19:06:44,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1964519427 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In-1964519427| |P0Thread1of1ForFork2_#t~ite11_Out-1964519427|) (= ~x$w_buff1~0_In-1964519427 |P0Thread1of1ForFork2_#t~ite12_Out-1964519427|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1964519427 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1964519427 256))) (= 0 (mod ~x$w_buff0_used~0_In-1964519427 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1964519427 256))))) (= |P0Thread1of1ForFork2_#t~ite11_Out-1964519427| ~x$w_buff1~0_In-1964519427) (= |P0Thread1of1ForFork2_#t~ite11_Out-1964519427| |P0Thread1of1ForFork2_#t~ite12_Out-1964519427|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1964519427, ~x$w_buff1~0=~x$w_buff1~0_In-1964519427, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1964519427, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1964519427, ~weak$$choice2~0=~weak$$choice2~0_In-1964519427, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1964519427|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1964519427} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1964519427, ~x$w_buff1~0=~x$w_buff1~0_In-1964519427, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1964519427, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1964519427, ~weak$$choice2~0=~weak$$choice2~0_In-1964519427, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1964519427|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1964519427|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1964519427} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 19:06:44,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In390132024 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out390132024| ~x$w_buff0_used~0_In390132024) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In390132024| |P0Thread1of1ForFork2_#t~ite14_Out390132024|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out390132024| |P0Thread1of1ForFork2_#t~ite14_Out390132024|) (= |P0Thread1of1ForFork2_#t~ite14_Out390132024| ~x$w_buff0_used~0_In390132024) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In390132024 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In390132024 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In390132024 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In390132024 256))))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In390132024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In390132024, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In390132024, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In390132024|, ~weak$$choice2~0=~weak$$choice2~0_In390132024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390132024} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In390132024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In390132024, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out390132024|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In390132024, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out390132024|, ~weak$$choice2~0=~weak$$choice2~0_In390132024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390132024} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 19:06:44,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 19:06:44,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-603865158 256) 0))) (or (and (not .cse0) (= ~x$r_buff1_thd1~0_In-603865158 |P0Thread1of1ForFork2_#t~ite24_Out-603865158|) (= |P0Thread1of1ForFork2_#t~ite23_In-603865158| |P0Thread1of1ForFork2_#t~ite23_Out-603865158|)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-603865158| |P0Thread1of1ForFork2_#t~ite24_Out-603865158|) (= ~x$r_buff1_thd1~0_In-603865158 |P0Thread1of1ForFork2_#t~ite23_Out-603865158|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-603865158 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-603865158 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-603865158 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-603865158 256) 0)))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-603865158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-603865158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-603865158, ~weak$$choice2~0=~weak$$choice2~0_In-603865158, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-603865158|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-603865158} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-603865158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-603865158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-603865158, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-603865158|, ~weak$$choice2~0=~weak$$choice2~0_In-603865158, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-603865158|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-603865158} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 19:06:44,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 19:06:44,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-174960764 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-174960764 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-174960764| ~x$w_buff0_used~0_In-174960764) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-174960764| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-174960764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174960764} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-174960764, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-174960764|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174960764} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 19:06:44,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1129792225 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1129792225 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1129792225 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1129792225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1129792225|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1129792225| ~x$w_buff1_used~0_In1129792225)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1129792225, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1129792225, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1129792225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1129792225} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1129792225, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1129792225, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1129792225, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1129792225|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1129792225} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 19:06:44,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1683014982 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1683014982 256)))) (or (and (= ~x$r_buff0_thd2~0_Out1683014982 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1683014982 ~x$r_buff0_thd2~0_Out1683014982) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1683014982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1683014982} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1683014982|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1683014982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1683014982} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 19:06:44,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1494824795 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1494824795 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1494824795 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1494824795 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1494824795| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1494824795| ~x$r_buff1_thd2~0_In1494824795)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1494824795, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1494824795, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1494824795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1494824795} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1494824795|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1494824795, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1494824795, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1494824795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1494824795} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 19:06:44,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 19:06:44,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:06:44,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1669893434| |ULTIMATE.start_main_#t~ite42_Out-1669893434|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1669893434 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1669893434 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1669893434| ~x~0_In-1669893434) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1669893434| ~x$w_buff1~0_In-1669893434) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1669893434, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669893434, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1669893434, ~x~0=~x~0_In-1669893434} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1669893434|, ~x$w_buff1~0=~x$w_buff1~0_In-1669893434, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669893434, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1669893434, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1669893434|, ~x~0=~x~0_In-1669893434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 19:06:44,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2130509343 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2130509343 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-2130509343|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2130509343 |ULTIMATE.start_main_#t~ite43_Out-2130509343|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2130509343, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130509343} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2130509343, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2130509343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130509343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 19:06:44,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1643765792 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1643765792 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1643765792 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1643765792 256)))) (or (and (= ~x$w_buff1_used~0_In1643765792 |ULTIMATE.start_main_#t~ite44_Out1643765792|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1643765792| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1643765792, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1643765792, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1643765792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1643765792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1643765792, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1643765792, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1643765792, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1643765792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1643765792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 19:06:44,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In2045479694 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2045479694 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out2045479694|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2045479694| ~x$r_buff0_thd0~0_In2045479694)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2045479694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2045479694} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2045479694, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2045479694|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2045479694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 19:06:44,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In975468222 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In975468222 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In975468222 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In975468222 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In975468222 |ULTIMATE.start_main_#t~ite46_Out975468222|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out975468222|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975468222, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975468222, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975468222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975468222} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975468222, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out975468222|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975468222, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975468222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975468222} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 19:06:44,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, 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~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:06:44,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:06:44 BasicIcfg [2019-12-18 19:06:44,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:06:44,797 INFO L168 Benchmark]: Toolchain (without parser) took 62354.57 ms. Allocated memory was 136.8 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 99.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 995.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,798 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.61 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,800 INFO L168 Benchmark]: Boogie Preprocessor took 62.59 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,801 INFO L168 Benchmark]: RCFGBuilder took 748.81 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 101.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,801 INFO L168 Benchmark]: TraceAbstraction took 60691.15 ms. Allocated memory was 200.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 932.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:06:44,805 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.78 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.61 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.59 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.81 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 101.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60691.15 ms. Allocated memory was 200.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 932.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 60.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3034 SDtfs, 2779 SDslu, 6644 SDs, 0 SdLazy, 2223 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 96978 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...