/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:08:30,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:08:30,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:08:30,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:08:30,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:08:30,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:08:30,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:08:30,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:08:30,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:08:30,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:08:30,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:08:30,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:08:30,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:08:30,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:08:30,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:08:30,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:08:30,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:08:30,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:08:30,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:08:30,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:08:30,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:08:30,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:08:30,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:08:30,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:08:30,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:08:30,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:08:30,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:08:30,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:08:30,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:08:30,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:08:30,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:08:30,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:08:30,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:08:30,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:08:30,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:08:30,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:08:30,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:08:30,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:08:30,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:08:30,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:08:30,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:08:30,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:08:30,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:08:30,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:08:30,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:08:30,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:08:30,215 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:08:30,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:08:30,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:08:30,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:08:30,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:08:30,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:08:30,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:08:30,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:08:30,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:08:30,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:08:30,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:08:30,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:08:30,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:08:30,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:08:30,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:08:30,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:08:30,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:08:30,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:08:30,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:08:30,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:08:30,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:08:30,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:08:30,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:08:30,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:08:30,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:08:30,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:08:30,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:08:30,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:08:30,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:08:30,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:08:30,522 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:08:30,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-18 22:08:30,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df91fe2ff/bb05b59c5abf4f658ef0b7255a3e4ad7/FLAGfd213b415 [2019-12-18 22:08:31,164 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:08:31,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-18 22:08:31,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df91fe2ff/bb05b59c5abf4f658ef0b7255a3e4ad7/FLAGfd213b415 [2019-12-18 22:08:31,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df91fe2ff/bb05b59c5abf4f658ef0b7255a3e4ad7 [2019-12-18 22:08:31,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:08:31,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:08:31,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:31,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:08:31,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:08:31,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:31" (1/1) ... [2019-12-18 22:08:31,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ad2082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:31, skipping insertion in model container [2019-12-18 22:08:31,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:31" (1/1) ... [2019-12-18 22:08:31,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:08:31,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:08:32,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:32,073 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:08:32,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:32,216 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:08:32,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32 WrapperNode [2019-12-18 22:08:32,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:32,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:32,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:08:32,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:08:32,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:32,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:08:32,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:08:32,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:08:32,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (1/1) ... [2019-12-18 22:08:32,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:08:32,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:08:32,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:08:32,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:08:32,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (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 22:08:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:08:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:08:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:08:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:08:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:08:32,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:08:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:08:32,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:08:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:08:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:08:32,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:08:32,414 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 22:08:33,116 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:08:33,117 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:08:33,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:33 BoogieIcfgContainer [2019-12-18 22:08:33,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:08:33,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:08:33,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:08:33,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:08:33,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:31" (1/3) ... [2019-12-18 22:08:33,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ff72e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:33, skipping insertion in model container [2019-12-18 22:08:33,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:32" (2/3) ... [2019-12-18 22:08:33,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ff72e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:33, skipping insertion in model container [2019-12-18 22:08:33,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:33" (3/3) ... [2019-12-18 22:08:33,128 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-18 22:08:33,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:08:33,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:08:33,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:08:33,149 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:08:33,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:33,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:08:33,308 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:08:33,308 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:08:33,308 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:08:33,309 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:08:33,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:08:33,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:08:33,309 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:08:33,309 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:08:33,332 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 22:08:33,334 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:08:33,439 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:08:33,440 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:33,454 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:08:33,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:08:33,519 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:08:33,519 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:33,527 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:08:33,543 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 22:08:33,544 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:08:36,652 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 22:08:36,769 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:08:36,862 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-18 22:08:36,862 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 22:08:36,866 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-18 22:08:37,411 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-18 22:08:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-18 22:08:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:08:37,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:37,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:08:37,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-18 22:08:37,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:37,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941513190] [2019-12-18 22:08:37,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:37,763 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 22:08:37,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941513190] [2019-12-18 22:08:37,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:37,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:08:37,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735167001] [2019-12-18 22:08:37,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:37,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:37,798 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-18 22:08:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:38,121 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-18 22:08:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:38,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:08:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:38,256 INFO L225 Difference]: With dead ends: 9421 [2019-12-18 22:08:38,256 INFO L226 Difference]: Without dead ends: 8862 [2019-12-18 22:08:38,266 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 22:08:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-18 22:08:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-18 22:08:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-18 22:08:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-18 22:08:38,800 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-18 22:08:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:38,800 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-18 22:08:38,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-18 22:08:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:08:38,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:38,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:38,807 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-18 22:08:38,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:38,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446566811] [2019-12-18 22:08:38,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:38,992 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 22:08:38,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446566811] [2019-12-18 22:08:38,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:38,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:38,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121874210] [2019-12-18 22:08:38,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:08:38,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:08:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:08:38,998 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-18 22:08:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:39,502 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-18 22:08:39,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:08:39,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:08:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:39,578 INFO L225 Difference]: With dead ends: 13396 [2019-12-18 22:08:39,578 INFO L226 Difference]: Without dead ends: 13389 [2019-12-18 22:08:39,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-18 22:08:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-18 22:08:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-18 22:08:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-18 22:08:40,230 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-18 22:08:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:40,231 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-18 22:08:40,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:08:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-18 22:08:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:08:40,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:40,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:40,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-18 22:08:40,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:40,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240110338] [2019-12-18 22:08:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:40,302 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 22:08:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240110338] [2019-12-18 22:08:40,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:40,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:40,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899219334] [2019-12-18 22:08:40,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:08:40,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:08:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:08:40,305 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-18 22:08:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:40,663 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-18 22:08:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:08:40,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:08:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:40,716 INFO L225 Difference]: With dead ends: 14164 [2019-12-18 22:08:40,716 INFO L226 Difference]: Without dead ends: 14164 [2019-12-18 22:08:40,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-18 22:08:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-18 22:08:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-18 22:08:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-18 22:08:41,850 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-18 22:08:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:41,853 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-18 22:08:41,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:08:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-18 22:08:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:08:41,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:41,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:41,858 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-18 22:08:41,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18816978] [2019-12-18 22:08:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:41,930 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 22:08:41,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18816978] [2019-12-18 22:08:41,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:41,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:08:41,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166025313] [2019-12-18 22:08:41,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:41,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:41,932 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-18 22:08:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:42,068 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-18 22:08:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:42,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:08:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:42,113 INFO L225 Difference]: With dead ends: 12673 [2019-12-18 22:08:42,115 INFO L226 Difference]: Without dead ends: 12673 [2019-12-18 22:08:42,116 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 22:08:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-18 22:08:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-18 22:08:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-18 22:08:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-18 22:08:42,575 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-18 22:08:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:42,576 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-18 22:08:42,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-18 22:08:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:08:42,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:42,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:42,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-18 22:08:42,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:42,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676456130] [2019-12-18 22:08:42,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:42,622 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 22:08:42,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676456130] [2019-12-18 22:08:42,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:42,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:42,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305637559] [2019-12-18 22:08:42,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:42,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:42,624 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-18 22:08:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:42,721 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-18 22:08:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:42,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:08:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:42,766 INFO L225 Difference]: With dead ends: 21543 [2019-12-18 22:08:42,766 INFO L226 Difference]: Without dead ends: 12171 [2019-12-18 22:08:42,766 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 22:08:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-18 22:08:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-18 22:08:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-18 22:08:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-18 22:08:43,282 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-18 22:08:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:43,283 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-18 22:08:43,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-18 22:08:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:08:43,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:43,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:43,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-18 22:08:43,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:43,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746585341] [2019-12-18 22:08:43,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:43,393 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 22:08:43,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746585341] [2019-12-18 22:08:43,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:43,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:08:43,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181553685] [2019-12-18 22:08:43,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:08:43,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:43,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:08:43,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:08:43,396 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 4 states. [2019-12-18 22:08:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:43,437 INFO L93 Difference]: Finished difference Result 1920 states and 4675 transitions. [2019-12-18 22:08:43,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:08:43,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:08:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:43,441 INFO L225 Difference]: With dead ends: 1920 [2019-12-18 22:08:43,442 INFO L226 Difference]: Without dead ends: 1382 [2019-12-18 22:08:43,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-18 22:08:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2019-12-18 22:08:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-12-18 22:08:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3017 transitions. [2019-12-18 22:08:43,466 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3017 transitions. Word has length 17 [2019-12-18 22:08:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:43,467 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 3017 transitions. [2019-12-18 22:08:43,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:08:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3017 transitions. [2019-12-18 22:08:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:08:43,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:43,469 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 22:08:43,469 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-18 22:08:43,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:43,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933702708] [2019-12-18 22:08:43,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:43,556 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 22:08:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933702708] [2019-12-18 22:08:43,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:43,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:08:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695583967] [2019-12-18 22:08:43,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:08:43,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:08:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:08:43,558 INFO L87 Difference]: Start difference. First operand 1378 states and 3017 transitions. Second operand 6 states. [2019-12-18 22:08:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:44,169 INFO L93 Difference]: Finished difference Result 3860 states and 8328 transitions. [2019-12-18 22:08:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:08:44,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 22:08:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:44,181 INFO L225 Difference]: With dead ends: 3860 [2019-12-18 22:08:44,181 INFO L226 Difference]: Without dead ends: 3825 [2019-12-18 22:08:44,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:08:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-12-18 22:08:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2035. [2019-12-18 22:08:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-18 22:08:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4502 transitions. [2019-12-18 22:08:44,237 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4502 transitions. Word has length 25 [2019-12-18 22:08:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:44,238 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4502 transitions. [2019-12-18 22:08:44,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:08:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4502 transitions. [2019-12-18 22:08:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:08:44,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:44,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:44,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-18 22:08:44,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:44,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444831766] [2019-12-18 22:08:44,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:44,362 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 22:08:44,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444831766] [2019-12-18 22:08:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:08:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496371736] [2019-12-18 22:08:44,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:08:44,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:08:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:08:44,365 INFO L87 Difference]: Start difference. First operand 2035 states and 4502 transitions. Second operand 6 states. [2019-12-18 22:08:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:44,821 INFO L93 Difference]: Finished difference Result 3781 states and 8072 transitions. [2019-12-18 22:08:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:08:44,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 22:08:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:44,833 INFO L225 Difference]: With dead ends: 3781 [2019-12-18 22:08:44,833 INFO L226 Difference]: Without dead ends: 3752 [2019-12-18 22:08:44,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:08:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-18 22:08:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2007. [2019-12-18 22:08:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-18 22:08:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4455 transitions. [2019-12-18 22:08:44,882 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4455 transitions. Word has length 26 [2019-12-18 22:08:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:44,882 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4455 transitions. [2019-12-18 22:08:44,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:08:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4455 transitions. [2019-12-18 22:08:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:08:44,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:44,887 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] [2019-12-18 22:08:44,887 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1268776575, now seen corresponding path program 1 times [2019-12-18 22:08:44,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:44,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939188613] [2019-12-18 22:08:44,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:44,966 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 22:08:44,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939188613] [2019-12-18 22:08:44,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:44,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:08:44,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731050813] [2019-12-18 22:08:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:08:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:08:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:44,969 INFO L87 Difference]: Start difference. First operand 2007 states and 4455 transitions. Second operand 5 states. [2019-12-18 22:08:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:45,015 INFO L93 Difference]: Finished difference Result 1067 states and 2242 transitions. [2019-12-18 22:08:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:08:45,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:08:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:45,019 INFO L225 Difference]: With dead ends: 1067 [2019-12-18 22:08:45,019 INFO L226 Difference]: Without dead ends: 862 [2019-12-18 22:08:45,019 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 22:08:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-18 22:08:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 828. [2019-12-18 22:08:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-18 22:08:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1806 transitions. [2019-12-18 22:08:45,032 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1806 transitions. Word has length 27 [2019-12-18 22:08:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:45,033 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1806 transitions. [2019-12-18 22:08:45,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:08:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1806 transitions. [2019-12-18 22:08:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 22:08:45,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:45,038 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] [2019-12-18 22:08:45,039 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1725794524, now seen corresponding path program 1 times [2019-12-18 22:08:45,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:45,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748239099] [2019-12-18 22:08:45,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:45,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 22:08:45,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748239099] [2019-12-18 22:08:45,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:45,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:08:45,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764690440] [2019-12-18 22:08:45,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:08:45,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:08:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:08:45,175 INFO L87 Difference]: Start difference. First operand 828 states and 1806 transitions. Second operand 7 states. [2019-12-18 22:08:45,319 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 22:08:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:45,482 INFO L93 Difference]: Finished difference Result 1705 states and 3607 transitions. [2019-12-18 22:08:45,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:08:45,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 22:08:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:45,485 INFO L225 Difference]: With dead ends: 1705 [2019-12-18 22:08:45,485 INFO L226 Difference]: Without dead ends: 1136 [2019-12-18 22:08:45,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:08:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-18 22:08:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 903. [2019-12-18 22:08:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-18 22:08:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1931 transitions. [2019-12-18 22:08:45,501 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1931 transitions. Word has length 51 [2019-12-18 22:08:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:45,502 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1931 transitions. [2019-12-18 22:08:45,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:08:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1931 transitions. [2019-12-18 22:08:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 22:08:45,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:45,505 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] [2019-12-18 22:08:45,505 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1701166622, now seen corresponding path program 2 times [2019-12-18 22:08:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:45,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003271343] [2019-12-18 22:08:45,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:45,581 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 22:08:45,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003271343] [2019-12-18 22:08:45,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:45,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:45,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992796768] [2019-12-18 22:08:45,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:45,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:45,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:45,583 INFO L87 Difference]: Start difference. First operand 903 states and 1931 transitions. Second operand 3 states. [2019-12-18 22:08:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:45,648 INFO L93 Difference]: Finished difference Result 1183 states and 2500 transitions. [2019-12-18 22:08:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:45,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 22:08:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:45,651 INFO L225 Difference]: With dead ends: 1183 [2019-12-18 22:08:45,651 INFO L226 Difference]: Without dead ends: 1183 [2019-12-18 22:08:45,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 22:08:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-18 22:08:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 993. [2019-12-18 22:08:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-18 22:08:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2127 transitions. [2019-12-18 22:08:45,678 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2127 transitions. Word has length 51 [2019-12-18 22:08:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:45,679 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2127 transitions. [2019-12-18 22:08:45,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2127 transitions. [2019-12-18 22:08:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:08:45,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:45,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:45,683 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1213233403, now seen corresponding path program 1 times [2019-12-18 22:08:45,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:45,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377013650] [2019-12-18 22:08:45,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:45,726 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 22:08:45,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377013650] [2019-12-18 22:08:45,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:45,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:08:45,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281461535] [2019-12-18 22:08:45,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:45,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:45,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:45,730 INFO L87 Difference]: Start difference. First operand 993 states and 2127 transitions. Second operand 3 states. [2019-12-18 22:08:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:45,776 INFO L93 Difference]: Finished difference Result 1082 states and 2252 transitions. [2019-12-18 22:08:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:45,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 22:08:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:45,779 INFO L225 Difference]: With dead ends: 1082 [2019-12-18 22:08:45,780 INFO L226 Difference]: Without dead ends: 1082 [2019-12-18 22:08:45,780 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 22:08:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-12-18 22:08:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 930. [2019-12-18 22:08:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-18 22:08:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1974 transitions. [2019-12-18 22:08:45,805 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1974 transitions. Word has length 52 [2019-12-18 22:08:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:45,805 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1974 transitions. [2019-12-18 22:08:45,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1974 transitions. [2019-12-18 22:08:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:08:45,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:45,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] [2019-12-18 22:08:45,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:45,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash 105545405, now seen corresponding path program 1 times [2019-12-18 22:08:45,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:45,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159431338] [2019-12-18 22:08:45,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:46,030 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 22:08:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159431338] [2019-12-18 22:08:46,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:46,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:08:46,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644563788] [2019-12-18 22:08:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:08:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:08:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:08:46,033 INFO L87 Difference]: Start difference. First operand 930 states and 1974 transitions. Second operand 6 states. [2019-12-18 22:08:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:46,551 INFO L93 Difference]: Finished difference Result 1574 states and 3262 transitions. [2019-12-18 22:08:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:08:46,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 22:08:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:46,554 INFO L225 Difference]: With dead ends: 1574 [2019-12-18 22:08:46,554 INFO L226 Difference]: Without dead ends: 1550 [2019-12-18 22:08:46,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:08:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-12-18 22:08:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1217. [2019-12-18 22:08:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 22:08:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 2583 transitions. [2019-12-18 22:08:46,575 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 2583 transitions. Word has length 52 [2019-12-18 22:08:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:46,575 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 2583 transitions. [2019-12-18 22:08:46,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:08:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 2583 transitions. [2019-12-18 22:08:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:08:46,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:46,579 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] [2019-12-18 22:08:46,579 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 926927619, now seen corresponding path program 2 times [2019-12-18 22:08:46,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:46,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737756103] [2019-12-18 22:08:46,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:46,645 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 22:08:46,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737756103] [2019-12-18 22:08:46,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:46,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:46,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044169837] [2019-12-18 22:08:46,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:46,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:46,647 INFO L87 Difference]: Start difference. First operand 1217 states and 2583 transitions. Second operand 3 states. [2019-12-18 22:08:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:46,661 INFO L93 Difference]: Finished difference Result 1216 states and 2581 transitions. [2019-12-18 22:08:46,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:46,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 22:08:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:46,663 INFO L225 Difference]: With dead ends: 1216 [2019-12-18 22:08:46,664 INFO L226 Difference]: Without dead ends: 1216 [2019-12-18 22:08:46,664 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 22:08:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-12-18 22:08:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 844. [2019-12-18 22:08:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-12-18 22:08:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1803 transitions. [2019-12-18 22:08:46,679 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1803 transitions. Word has length 52 [2019-12-18 22:08:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:46,680 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1803 transitions. [2019-12-18 22:08:46,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1803 transitions. [2019-12-18 22:08:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 22:08:46,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:46,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:46,683 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-18 22:08:46,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:46,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332358939] [2019-12-18 22:08:46,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:08:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:08:46,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:08:46,811 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:08:46,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22|)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22| 1)) (= 0 v_~x$w_buff0~0_25) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_17|) (= v_~y~0_15 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_22|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$w_buff0_used~0_102) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| 4) |v_#length_13|) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22|) |v_ULTIMATE.start_main_~#t1715~0.offset_17| 0))) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~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_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:08:46,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:08:46,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-18 22:08:46,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1888725262 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1888725262 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1888725262 |P0Thread1of1ForFork0_#t~ite5_Out-1888725262|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1888725262|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1888725262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888725262} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1888725262|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1888725262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888725262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:08:46,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In725973908 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out725973908| ~x$w_buff0~0_In725973908) (= |P1Thread1of1ForFork1_#t~ite14_In725973908| |P1Thread1of1ForFork1_#t~ite14_Out725973908|)) (and (= ~x$w_buff0~0_In725973908 |P1Thread1of1ForFork1_#t~ite14_Out725973908|) (= |P1Thread1of1ForFork1_#t~ite15_Out725973908| |P1Thread1of1ForFork1_#t~ite14_Out725973908|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In725973908 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In725973908 256))) (= (mod ~x$w_buff0_used~0_In725973908 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In725973908 256) 0))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In725973908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In725973908, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In725973908, ~weak$$choice2~0=~weak$$choice2~0_In725973908, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In725973908, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In725973908|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In725973908} OutVars{~x$w_buff0~0=~x$w_buff0~0_In725973908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In725973908, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In725973908, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out725973908|, ~weak$$choice2~0=~weak$$choice2~0_In725973908, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In725973908, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out725973908|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In725973908} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:08:46,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1052089065 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1052089065| |P1Thread1of1ForFork1_#t~ite18_Out1052089065|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1052089065 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In1052089065 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1052089065 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1052089065 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out1052089065| ~x$w_buff1~0_In1052089065)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1052089065| |P1Thread1of1ForFork1_#t~ite17_Out1052089065|) (= |P1Thread1of1ForFork1_#t~ite18_Out1052089065| ~x$w_buff1~0_In1052089065)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1052089065, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052089065, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052089065, ~weak$$choice2~0=~weak$$choice2~0_In1052089065, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052089065, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1052089065|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052089065} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1052089065|, ~x$w_buff1~0=~x$w_buff1~0_In1052089065, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052089065, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052089065, ~weak$$choice2~0=~weak$$choice2~0_In1052089065, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052089065, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1052089065|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052089065} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:08:46,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1630239511 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1630239511| |P1Thread1of1ForFork1_#t~ite20_Out1630239511|) (= ~x$w_buff0_used~0_In1630239511 |P1Thread1of1ForFork1_#t~ite20_Out1630239511|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1630239511 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1630239511 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In1630239511 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In1630239511 256) 0)))) .cse1) (and (= ~x$w_buff0_used~0_In1630239511 |P1Thread1of1ForFork1_#t~ite21_Out1630239511|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In1630239511| |P1Thread1of1ForFork1_#t~ite20_Out1630239511|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1630239511|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630239511, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1630239511, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1630239511, ~weak$$choice2~0=~weak$$choice2~0_In1630239511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1630239511} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1630239511|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1630239511, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1630239511, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1630239511|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1630239511, ~weak$$choice2~0=~weak$$choice2~0_In1630239511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1630239511} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 22:08:46,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In2146671955 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In2146671955 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2146671955 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In2146671955 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out2146671955| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out2146671955| ~x$w_buff1_used~0_In2146671955)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2146671955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2146671955, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2146671955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146671955} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2146671955|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2146671955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2146671955, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2146671955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146671955} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:08:46,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1438786171 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1438786171 256)))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-1438786171) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-1438786171 ~x$r_buff0_thd1~0_Out-1438786171) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1438786171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1438786171} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1438786171, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1438786171|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1438786171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:08:46,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2109863630 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2109863630 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2109863630 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2109863630 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2109863630| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2109863630| ~x$r_buff1_thd1~0_In-2109863630) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2109863630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2109863630, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2109863630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2109863630} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2109863630, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2109863630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2109863630, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2109863630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2109863630} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:08:46,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:08:46,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 22:08:46,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1217755946 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1217755946| ~x$r_buff1_thd2~0_In1217755946) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1217755946| |P1Thread1of1ForFork1_#t~ite29_Out1217755946|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1217755946| ~x$r_buff1_thd2~0_In1217755946) (= |P1Thread1of1ForFork1_#t~ite30_Out1217755946| |P1Thread1of1ForFork1_#t~ite29_Out1217755946|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1217755946 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1217755946 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In1217755946 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1217755946 256))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1217755946|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1217755946, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1217755946, ~weak$$choice2~0=~weak$$choice2~0_In1217755946, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1217755946, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1217755946} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1217755946|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1217755946|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1217755946, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1217755946, ~weak$$choice2~0=~weak$$choice2~0_In1217755946, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1217755946, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1217755946} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 22:08:46,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 22:08:46,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In51433027 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In51433027 256) 0))) (or (and (= ~x~0_In51433027 |P1Thread1of1ForFork1_#t~ite32_Out51433027|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In51433027 |P1Thread1of1ForFork1_#t~ite32_Out51433027|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In51433027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In51433027, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In51433027, ~x~0=~x~0_In51433027} OutVars{~x$w_buff1~0=~x$w_buff1~0_In51433027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In51433027, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In51433027, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out51433027|, ~x~0=~x~0_In51433027} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:08:46,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:08:46,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1861189813 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1861189813 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1861189813| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1861189813 |P1Thread1of1ForFork1_#t~ite34_Out-1861189813|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1861189813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1861189813} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1861189813|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1861189813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1861189813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:08:46,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-97678022 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-97678022 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-97678022 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-97678022 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-97678022| ~x$w_buff1_used~0_In-97678022) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out-97678022| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-97678022, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-97678022, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-97678022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97678022} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-97678022, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-97678022, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-97678022|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-97678022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97678022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:08:46,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-759522876 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-759522876 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-759522876| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-759522876| ~x$r_buff0_thd2~0_In-759522876) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-759522876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759522876} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-759522876, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-759522876|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-759522876} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:08:46,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1251762856 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1251762856 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1251762856 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1251762856 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1251762856| ~x$r_buff1_thd2~0_In-1251762856) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1251762856| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1251762856, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1251762856, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1251762856, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1251762856} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1251762856, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1251762856, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1251762856, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1251762856|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1251762856} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:08:46,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:08:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:08:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In237924123 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In237924123 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In237924123 |ULTIMATE.start_main_#t~ite40_Out237924123|)) (and (or .cse0 .cse1) (= ~x~0_In237924123 |ULTIMATE.start_main_#t~ite40_Out237924123|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In237924123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In237924123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In237924123, ~x~0=~x~0_In237924123} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out237924123|, ~x$w_buff1~0=~x$w_buff1~0_In237924123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In237924123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In237924123, ~x~0=~x~0_In237924123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 22:08:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 22:08:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-401750551 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-401750551 256) 0))) (or (and (= ~x$w_buff0_used~0_In-401750551 |ULTIMATE.start_main_#t~ite42_Out-401750551|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-401750551|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-401750551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401750551} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-401750551, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-401750551|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401750551} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:08:46,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In1945150142 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1945150142 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1945150142 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1945150142 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1945150142| ~x$w_buff1_used~0_In1945150142)) (and (= |ULTIMATE.start_main_#t~ite43_Out1945150142| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1945150142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1945150142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1945150142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1945150142} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1945150142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1945150142, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1945150142|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1945150142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1945150142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:08:46,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1997934464 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1997934464 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1997934464| ~x$r_buff0_thd0~0_In-1997934464) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1997934464| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997934464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997934464} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997934464, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1997934464|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997934464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:08:46,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In565302668 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In565302668 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In565302668 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In565302668 256)))) (or (and (= ~x$r_buff1_thd0~0_In565302668 |ULTIMATE.start_main_#t~ite45_Out565302668|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out565302668| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In565302668, ~x$w_buff1_used~0=~x$w_buff1_used~0_In565302668, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In565302668, ~x$w_buff0_used~0=~x$w_buff0_used~0_In565302668} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In565302668, ~x$w_buff1_used~0=~x$w_buff1_used~0_In565302668, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In565302668, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out565302668|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In565302668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:08:46,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:08:46,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:08:46 BasicIcfg [2019-12-18 22:08:46,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:08:46,925 INFO L168 Benchmark]: Toolchain (without parser) took 15497.40 ms. Allocated memory was 138.9 MB in the beginning and 634.4 MB in the end (delta: 495.5 MB). Free memory was 101.9 MB in the beginning and 145.3 MB in the end (delta: -43.4 MB). Peak memory consumption was 452.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,926 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:08:46,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.85 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,928 INFO L168 Benchmark]: Boogie Preprocessor took 39.56 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,928 INFO L168 Benchmark]: RCFGBuilder took 798.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.6 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,929 INFO L168 Benchmark]: TraceAbstraction took 13801.10 ms. Allocated memory was 203.9 MB in the beginning and 634.4 MB in the end (delta: 430.4 MB). Free memory was 108.6 MB in the beginning and 145.3 MB in the end (delta: -36.6 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:08:46,933 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.85 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.56 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.6 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13801.10 ms. Allocated memory was 203.9 MB in the beginning and 634.4 MB in the end (delta: 430.4 MB). Free memory was 108.6 MB in the beginning and 145.3 MB in the end (delta: -36.6 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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 [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L808] 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 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1754 SDtfs, 1733 SDslu, 2824 SDs, 0 SdLazy, 1570 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 8411 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 49032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...