/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:19:17,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:19:17,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:19:17,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:19:17,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:19:17,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:19:17,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:19:17,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:19:17,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:19:17,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:19:17,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:19:17,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:19:17,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:19:17,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:19:17,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:19:17,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:19:17,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:19:17,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:19:17,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:19:17,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:19:17,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:19:17,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:19:17,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:19:17,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:19:17,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:19:17,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:19:17,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:19:17,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:19:17,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:19:17,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:19:17,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:19:17,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:19:17,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:19:17,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:19:17,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:19:17,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:19:17,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:19:17,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:19:17,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:19:17,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:19:17,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:19:17,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:19:17,249 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:19:17,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:19:17,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:19:17,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:19:17,253 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:19:17,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:19:17,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:19:17,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:19:17,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:19:17,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:19:17,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:19:17,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:19:17,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:19:17,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:19:17,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:19:17,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:19:17,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:17,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:19:17,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:19:17,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:19:17,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:19:17,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:19:17,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:19:17,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:19:17,546 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:19:17,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-26 22:19:17,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43ee1087/b1eb1478005a4ad5b8b956ef811a7662/FLAGb2da9d6e1 [2019-12-26 22:19:18,207 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:19:18,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-26 22:19:18,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43ee1087/b1eb1478005a4ad5b8b956ef811a7662/FLAGb2da9d6e1 [2019-12-26 22:19:18,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43ee1087/b1eb1478005a4ad5b8b956ef811a7662 [2019-12-26 22:19:18,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:19:18,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:19:18,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:18,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:19:18,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:19:18,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:18" (1/1) ... [2019-12-26 22:19:18,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:18, skipping insertion in model container [2019-12-26 22:19:18,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:18" (1/1) ... [2019-12-26 22:19:18,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:19:18,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:19:19,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:19,124 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:19:19,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:19,276 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:19:19,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19 WrapperNode [2019-12-26 22:19:19,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:19,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:19,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:19:19,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:19:19,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:19,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:19:19,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:19:19,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:19:19,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (1/1) ... [2019-12-26 22:19:19,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:19:19,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:19:19,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:19:19,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:19:19,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (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-26 22:19:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:19:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:19:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:19:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:19:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:19:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:19:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:19:19,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:19:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:19:19,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:19:19,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:19:19,444 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:19:20,195 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:19:20,196 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:19:20,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:20 BoogieIcfgContainer [2019-12-26 22:19:20,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:19:20,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:19:20,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:19:20,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:19:20,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:19:18" (1/3) ... [2019-12-26 22:19:20,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55288d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:20, skipping insertion in model container [2019-12-26 22:19:20,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:19" (2/3) ... [2019-12-26 22:19:20,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55288d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:20, skipping insertion in model container [2019-12-26 22:19:20,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:20" (3/3) ... [2019-12-26 22:19:20,206 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-26 22:19:20,215 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:19:20,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:19:20,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:19:20,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:19:20,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:20,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:19:20,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:19:20,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:19:20,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:19:20,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:19:20,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:19:20,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:19:20,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:19:20,402 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:19:20,424 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-26 22:19:20,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:19:20,531 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:19:20,532 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:20,545 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:19:20,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-26 22:19:20,612 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-26 22:19:20,612 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:20,618 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:19:20,633 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:19:20,634 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:19:25,848 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:19:25,975 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:19:25,999 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-26 22:19:25,999 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-26 22:19:26,003 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-26 22:19:26,553 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 22:19:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 22:19:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:19:26,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:26,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:19:26,574 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-26 22:19:26,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:26,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519727209] [2019-12-26 22:19:26,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:26,929 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-26 22:19:26,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519727209] [2019-12-26 22:19:26,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:26,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:26,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173549375] [2019-12-26 22:19:26,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:26,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:26,957 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 22:19:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:27,241 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-26 22:19:27,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:27,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:19:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:27,331 INFO L225 Difference]: With dead ends: 8472 [2019-12-26 22:19:27,331 INFO L226 Difference]: Without dead ends: 7980 [2019-12-26 22:19:27,333 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-26 22:19:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-26 22:19:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-26 22:19:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-26 22:19:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-26 22:19:27,938 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-26 22:19:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:27,939 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-26 22:19:27,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-26 22:19:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:19:27,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:27,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:27,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-26 22:19:27,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:27,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201610224] [2019-12-26 22:19:27,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:27,989 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-26 22:19:27,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201610224] [2019-12-26 22:19:27,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:27,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:27,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187346160] [2019-12-26 22:19:27,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:27,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:27,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:27,993 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-26 22:19:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:28,026 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-26 22:19:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:28,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 22:19:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:28,034 INFO L225 Difference]: With dead ends: 1284 [2019-12-26 22:19:28,034 INFO L226 Difference]: Without dead ends: 1284 [2019-12-26 22:19:28,037 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-26 22:19:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-26 22:19:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-26 22:19:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-26 22:19:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-26 22:19:28,080 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-26 22:19:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:28,081 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-26 22:19:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-26 22:19:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:28,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:28,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:28,088 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-26 22:19:28,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:28,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303379686] [2019-12-26 22:19:28,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:28,235 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-26 22:19:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303379686] [2019-12-26 22:19:28,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:28,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:28,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863994603] [2019-12-26 22:19:28,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:28,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:28,237 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-26 22:19:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:28,308 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-26 22:19:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:28,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 22:19:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:28,321 INFO L225 Difference]: With dead ends: 1993 [2019-12-26 22:19:28,321 INFO L226 Difference]: Without dead ends: 1993 [2019-12-26 22:19:28,322 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-26 22:19:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-26 22:19:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-26 22:19:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-26 22:19:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-26 22:19:28,367 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-26 22:19:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:28,367 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-26 22:19:28,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-26 22:19:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:28,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:28,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:28,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-26 22:19:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:28,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581107197] [2019-12-26 22:19:28,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:28,427 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-26 22:19:28,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581107197] [2019-12-26 22:19:28,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:28,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:28,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521780536] [2019-12-26 22:19:28,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:28,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:28,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:28,433 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-26 22:19:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:28,635 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-26 22:19:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:28,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:19:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:28,646 INFO L225 Difference]: With dead ends: 1803 [2019-12-26 22:19:28,646 INFO L226 Difference]: Without dead ends: 1803 [2019-12-26 22:19:28,647 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-26 22:19:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-26 22:19:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-26 22:19:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-26 22:19:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-26 22:19:28,695 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-26 22:19:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:28,695 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-26 22:19:28,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-26 22:19:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:19:28,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:28,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:19:28,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-26 22:19:28,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:28,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10719238] [2019-12-26 22:19:28,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:28,764 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-26 22:19:28,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10719238] [2019-12-26 22:19:28,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:28,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:28,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422362480] [2019-12-26 22:19:28,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:28,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:28,766 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-26 22:19:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:29,021 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-26 22:19:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:29,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:19:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:29,037 INFO L225 Difference]: With dead ends: 2116 [2019-12-26 22:19:29,037 INFO L226 Difference]: Without dead ends: 2116 [2019-12-26 22:19:29,038 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-26 22:19:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-26 22:19:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-26 22:19:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-26 22:19:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-26 22:19:29,108 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-26 22:19:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:29,110 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-26 22:19:29,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-26 22:19:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:19:29,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:29,113 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-26 22:19:29,113 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-26 22:19:29,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:29,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941433188] [2019-12-26 22:19:29,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:29,240 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-26 22:19:29,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941433188] [2019-12-26 22:19:29,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:29,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:29,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348277916] [2019-12-26 22:19:29,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:29,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:29,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:29,243 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-26 22:19:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:29,481 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-26 22:19:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:19:29,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 22:19:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:29,514 INFO L225 Difference]: With dead ends: 2383 [2019-12-26 22:19:29,516 INFO L226 Difference]: Without dead ends: 2383 [2019-12-26 22:19:29,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-26 22:19:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-26 22:19:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-26 22:19:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-26 22:19:29,579 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-26 22:19:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:29,579 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-26 22:19:29,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-26 22:19:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:19:29,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:29,582 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-26 22:19:29,583 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-26 22:19:29,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:29,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479701353] [2019-12-26 22:19:29,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:29,661 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-26 22:19:29,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479701353] [2019-12-26 22:19:29,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:29,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:19:29,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696837349] [2019-12-26 22:19:29,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:29,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:29,664 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-26 22:19:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:29,685 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-26 22:19:29,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:29,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 22:19:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:29,706 INFO L225 Difference]: With dead ends: 2126 [2019-12-26 22:19:29,706 INFO L226 Difference]: Without dead ends: 2126 [2019-12-26 22:19:29,710 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-26 22:19:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-26 22:19:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-26 22:19:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-26 22:19:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-26 22:19:29,801 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-26 22:19:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:29,801 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-26 22:19:29,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-26 22:19:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:19:29,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:29,872 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-26 22:19:29,872 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-26 22:19:29,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:29,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008733871] [2019-12-26 22:19:29,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:29,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-26 22:19:29,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008733871] [2019-12-26 22:19:29,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:29,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56893816] [2019-12-26 22:19:29,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:29,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:29,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:29,969 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-26 22:19:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:30,207 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-26 22:19:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:19:30,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:19:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:30,214 INFO L225 Difference]: With dead ends: 2503 [2019-12-26 22:19:30,214 INFO L226 Difference]: Without dead ends: 2503 [2019-12-26 22:19:30,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-26 22:19:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-26 22:19:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-26 22:19:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-26 22:19:30,268 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-26 22:19:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:30,270 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-26 22:19:30,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-26 22:19:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:19:30,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:30,273 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-26 22:19:30,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-26 22:19:30,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:30,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602005421] [2019-12-26 22:19:30,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:30,328 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-26 22:19:30,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602005421] [2019-12-26 22:19:30,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:30,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:30,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362270363] [2019-12-26 22:19:30,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:30,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:30,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:30,332 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 4 states. [2019-12-26 22:19:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:30,362 INFO L93 Difference]: Finished difference Result 3149 states and 7351 transitions. [2019-12-26 22:19:30,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:30,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 22:19:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:30,367 INFO L225 Difference]: With dead ends: 3149 [2019-12-26 22:19:30,367 INFO L226 Difference]: Without dead ends: 1449 [2019-12-26 22:19:30,368 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-26 22:19:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-26 22:19:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1433. [2019-12-26 22:19:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-26 22:19:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-26 22:19:30,399 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-26 22:19:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:30,400 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-26 22:19:30,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-26 22:19:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:19:30,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:30,404 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-26 22:19:30,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-26 22:19:30,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:30,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610184481] [2019-12-26 22:19:30,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:30,506 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-26 22:19:30,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610184481] [2019-12-26 22:19:30,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:30,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:30,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114775585] [2019-12-26 22:19:30,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:30,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:30,509 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 5 states. [2019-12-26 22:19:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:30,999 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-26 22:19:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:30,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:19:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:31,005 INFO L225 Difference]: With dead ends: 2262 [2019-12-26 22:19:31,005 INFO L226 Difference]: Without dead ends: 2262 [2019-12-26 22:19:31,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-26 22:19:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-26 22:19:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-26 22:19:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-26 22:19:31,054 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-26 22:19:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:31,056 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-26 22:19:31,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-26 22:19:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:19:31,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:31,063 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] [2019-12-26 22:19:31,063 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-26 22:19:31,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:31,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27120853] [2019-12-26 22:19:31,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:31,113 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-26 22:19:31,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27120853] [2019-12-26 22:19:31,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:31,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:19:31,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963583491] [2019-12-26 22:19:31,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:31,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:31,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:31,116 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-26 22:19:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:31,137 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-26 22:19:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:31,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 22:19:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:31,140 INFO L225 Difference]: With dead ends: 1113 [2019-12-26 22:19:31,140 INFO L226 Difference]: Without dead ends: 1002 [2019-12-26 22:19:31,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-26 22:19:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-26 22:19:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-26 22:19:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-26 22:19:31,161 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-26 22:19:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:31,162 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-26 22:19:31,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-26 22:19:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:31,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:31,165 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-26 22:19:31,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-26 22:19:31,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:31,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020819083] [2019-12-26 22:19:31,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:31,322 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-26 22:19:31,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020819083] [2019-12-26 22:19:31,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:31,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:19:31,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796141474] [2019-12-26 22:19:31,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:19:31,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:31,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:19:31,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:31,324 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-26 22:19:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:31,619 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-26 22:19:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:19:31,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 22:19:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:31,624 INFO L225 Difference]: With dead ends: 2777 [2019-12-26 22:19:31,624 INFO L226 Difference]: Without dead ends: 1853 [2019-12-26 22:19:31,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:19:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-26 22:19:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-26 22:19:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-26 22:19:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-26 22:19:31,654 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-26 22:19:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:31,655 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-26 22:19:31,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:19:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-26 22:19:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:31,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:31,658 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-26 22:19:31,658 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-26 22:19:31,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:31,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214315600] [2019-12-26 22:19:31,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:31,743 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-26 22:19:31,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214315600] [2019-12-26 22:19:31,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:31,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:31,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012580930] [2019-12-26 22:19:31,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:31,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:31,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:31,746 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 5 states. [2019-12-26 22:19:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:31,946 INFO L93 Difference]: Finished difference Result 1135 states and 2453 transitions. [2019-12-26 22:19:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:31,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 22:19:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:31,950 INFO L225 Difference]: With dead ends: 1135 [2019-12-26 22:19:31,950 INFO L226 Difference]: Without dead ends: 1135 [2019-12-26 22:19:31,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-12-26 22:19:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1047. [2019-12-26 22:19:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-26 22:19:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2300 transitions. [2019-12-26 22:19:31,974 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2300 transitions. Word has length 51 [2019-12-26 22:19:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:31,975 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2300 transitions. [2019-12-26 22:19:31,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2300 transitions. [2019-12-26 22:19:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:19:31,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:31,978 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-26 22:19:31,978 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-26 22:19:31,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:31,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345481347] [2019-12-26 22:19:31,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:19:32,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345481347] [2019-12-26 22:19:32,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:32,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:32,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746286099] [2019-12-26 22:19:32,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:32,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:32,083 INFO L87 Difference]: Start difference. First operand 1047 states and 2300 transitions. Second operand 3 states. [2019-12-26 22:19:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:32,100 INFO L93 Difference]: Finished difference Result 1046 states and 2298 transitions. [2019-12-26 22:19:32,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:32,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:19:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:32,103 INFO L225 Difference]: With dead ends: 1046 [2019-12-26 22:19:32,103 INFO L226 Difference]: Without dead ends: 1046 [2019-12-26 22:19:32,104 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-26 22:19:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-26 22:19:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 931. [2019-12-26 22:19:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-26 22:19:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2087 transitions. [2019-12-26 22:19:32,124 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2087 transitions. Word has length 51 [2019-12-26 22:19:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:32,125 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 2087 transitions. [2019-12-26 22:19:32,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2087 transitions. [2019-12-26 22:19:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:19:32,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:32,128 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-26 22:19:32,128 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-26 22:19:32,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:32,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044699511] [2019-12-26 22:19:32,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:32,285 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-26 22:19:32,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044699511] [2019-12-26 22:19:32,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:32,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:19:32,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372957230] [2019-12-26 22:19:32,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:19:32,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:32,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:19:32,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:19:32,287 INFO L87 Difference]: Start difference. First operand 931 states and 2087 transitions. Second operand 8 states. [2019-12-26 22:19:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:32,903 INFO L93 Difference]: Finished difference Result 1244 states and 2634 transitions. [2019-12-26 22:19:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:19:32,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 22:19:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:32,907 INFO L225 Difference]: With dead ends: 1244 [2019-12-26 22:19:32,907 INFO L226 Difference]: Without dead ends: 1244 [2019-12-26 22:19:32,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:19:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-26 22:19:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 736. [2019-12-26 22:19:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-26 22:19:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1583 transitions. [2019-12-26 22:19:32,926 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1583 transitions. Word has length 52 [2019-12-26 22:19:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:32,927 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1583 transitions. [2019-12-26 22:19:32,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:19:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1583 transitions. [2019-12-26 22:19:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:19:32,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:32,929 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-26 22:19:32,929 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-26 22:19:32,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:32,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925733891] [2019-12-26 22:19:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:33,014 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-26 22:19:33,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925733891] [2019-12-26 22:19:33,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:33,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:19:33,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613008866] [2019-12-26 22:19:33,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:19:33,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:19:33,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:19:33,016 INFO L87 Difference]: Start difference. First operand 736 states and 1583 transitions. Second operand 3 states. [2019-12-26 22:19:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:33,083 INFO L93 Difference]: Finished difference Result 900 states and 1911 transitions. [2019-12-26 22:19:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:19:33,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 22:19:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:33,086 INFO L225 Difference]: With dead ends: 900 [2019-12-26 22:19:33,086 INFO L226 Difference]: Without dead ends: 900 [2019-12-26 22:19:33,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 22:19:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-26 22:19:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 750. [2019-12-26 22:19:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-26 22:19:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1614 transitions. [2019-12-26 22:19:33,110 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1614 transitions. Word has length 52 [2019-12-26 22:19:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:33,110 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1614 transitions. [2019-12-26 22:19:33,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:19:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1614 transitions. [2019-12-26 22:19:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:33,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:33,113 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-26 22:19:33,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-26 22:19:33,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:33,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205805776] [2019-12-26 22:19:33,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:33,205 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-26 22:19:33,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205805776] [2019-12-26 22:19:33,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:33,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:19:33,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169531269] [2019-12-26 22:19:33,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:19:33,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:19:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:19:33,208 INFO L87 Difference]: Start difference. First operand 750 states and 1614 transitions. Second operand 4 states. [2019-12-26 22:19:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:33,414 INFO L93 Difference]: Finished difference Result 1223 states and 2628 transitions. [2019-12-26 22:19:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:19:33,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-26 22:19:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:33,418 INFO L225 Difference]: With dead ends: 1223 [2019-12-26 22:19:33,419 INFO L226 Difference]: Without dead ends: 1223 [2019-12-26 22:19:33,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-26 22:19:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-26 22:19:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 825. [2019-12-26 22:19:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-26 22:19:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1799 transitions. [2019-12-26 22:19:33,444 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1799 transitions. Word has length 53 [2019-12-26 22:19:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:33,444 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1799 transitions. [2019-12-26 22:19:33,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:19:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1799 transitions. [2019-12-26 22:19:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:33,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:33,448 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-26 22:19:33,449 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-26 22:19:33,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:33,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114882963] [2019-12-26 22:19:33,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:33,541 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-26 22:19:33,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114882963] [2019-12-26 22:19:33,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:33,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:33,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050132170] [2019-12-26 22:19:33,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:19:33,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:33,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:19:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:19:33,549 INFO L87 Difference]: Start difference. First operand 825 states and 1799 transitions. Second operand 5 states. [2019-12-26 22:19:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:33,919 INFO L93 Difference]: Finished difference Result 992 states and 2117 transitions. [2019-12-26 22:19:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:19:33,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 22:19:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:33,922 INFO L225 Difference]: With dead ends: 992 [2019-12-26 22:19:33,922 INFO L226 Difference]: Without dead ends: 992 [2019-12-26 22:19:33,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-26 22:19:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 878. [2019-12-26 22:19:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-26 22:19:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1896 transitions. [2019-12-26 22:19:33,941 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1896 transitions. Word has length 53 [2019-12-26 22:19:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:33,941 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1896 transitions. [2019-12-26 22:19:33,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:19:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1896 transitions. [2019-12-26 22:19:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:33,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:33,944 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-26 22:19:33,944 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:33,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:33,944 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-26 22:19:33,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:33,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911406977] [2019-12-26 22:19:33,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:34,066 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-26 22:19:34,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911406977] [2019-12-26 22:19:34,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:34,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:19:34,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028379783] [2019-12-26 22:19:34,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:19:34,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:34,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:19:34,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:34,068 INFO L87 Difference]: Start difference. First operand 878 states and 1896 transitions. Second operand 7 states. [2019-12-26 22:19:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:34,319 INFO L93 Difference]: Finished difference Result 2191 states and 4561 transitions. [2019-12-26 22:19:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:19:34,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 22:19:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:34,323 INFO L225 Difference]: With dead ends: 2191 [2019-12-26 22:19:34,323 INFO L226 Difference]: Without dead ends: 1789 [2019-12-26 22:19:34,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:19:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-12-26 22:19:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 873. [2019-12-26 22:19:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-12-26 22:19:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1883 transitions. [2019-12-26 22:19:34,348 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1883 transitions. Word has length 53 [2019-12-26 22:19:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:34,348 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1883 transitions. [2019-12-26 22:19:34,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:19:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1883 transitions. [2019-12-26 22:19:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:34,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:34,351 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-26 22:19:34,351 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-26 22:19:34,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937512576] [2019-12-26 22:19:34,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:19:34,512 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-26 22:19:34,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937512576] [2019-12-26 22:19:34,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:19:34,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:19:34,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974362161] [2019-12-26 22:19:34,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:19:34,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:19:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:19:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:19:34,514 INFO L87 Difference]: Start difference. First operand 873 states and 1883 transitions. Second operand 6 states. [2019-12-26 22:19:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:19:34,591 INFO L93 Difference]: Finished difference Result 860 states and 1840 transitions. [2019-12-26 22:19:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:19:34,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-26 22:19:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:19:34,593 INFO L225 Difference]: With dead ends: 860 [2019-12-26 22:19:34,593 INFO L226 Difference]: Without dead ends: 860 [2019-12-26 22:19:34,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:19:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-12-26 22:19:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 721. [2019-12-26 22:19:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-26 22:19:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1538 transitions. [2019-12-26 22:19:34,606 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1538 transitions. Word has length 53 [2019-12-26 22:19:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:19:34,607 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1538 transitions. [2019-12-26 22:19:34,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:19:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1538 transitions. [2019-12-26 22:19:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:19:34,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:19:34,609 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-26 22:19:34,609 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:19:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:19:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-26 22:19:34,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:19:34,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707788559] [2019-12-26 22:19:34,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:19:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:19:34,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:19:34,727 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:19:34,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_23|) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35|) |v_ULTIMATE.start_main_~#t845~0.offset_23| 0)) |v_#memory_int_13|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t845~0.base_35| 4) |v_#length_15|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t845~0.base_35|) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_23|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_35|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 22:19:34,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0~0_In1540116881 ~a$w_buff1~0_Out1540116881) (= P0Thread1of1ForFork0_~arg.offset_Out1540116881 |P0Thread1of1ForFork0_#in~arg.offset_In1540116881|) (= |P0Thread1of1ForFork0_#in~arg.base_In1540116881| P0Thread1of1ForFork0_~arg.base_Out1540116881) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1540116881| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1540116881) (= 0 (mod ~a$w_buff1_used~0_Out1540116881 256)) (= ~a$w_buff0_used~0_In1540116881 ~a$w_buff1_used~0_Out1540116881) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1540116881|) (= 1 ~a$w_buff0~0_Out1540116881) (= ~a$w_buff0_used~0_Out1540116881 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1540116881|, ~a$w_buff0~0=~a$w_buff0~0_In1540116881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1540116881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1540116881} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1540116881|, ~a$w_buff1~0=~a$w_buff1~0_Out1540116881, ~a$w_buff0~0=~a$w_buff0~0_Out1540116881, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1540116881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1540116881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1540116881, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1540116881, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1540116881, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1540116881|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1540116881} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:19:34,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-12-26 22:19:34,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1873273495 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In1873273495| |P1Thread1of1ForFork1_#t~ite23_Out1873273495|) (= |P1Thread1of1ForFork1_#t~ite24_Out1873273495| ~a$w_buff1_used~0_In1873273495) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1873273495 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1873273495 256)) (and (= (mod ~a$w_buff1_used~0_In1873273495 256) 0) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1873273495 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out1873273495| ~a$w_buff1_used~0_In1873273495) (= |P1Thread1of1ForFork1_#t~ite23_Out1873273495| |P1Thread1of1ForFork1_#t~ite24_Out1873273495|) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1873273495, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1873273495, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1873273495|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1873273495, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1873273495, ~weak$$choice2~0=~weak$$choice2~0_In1873273495} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1873273495, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1873273495|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1873273495, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1873273495|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1873273495, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1873273495, ~weak$$choice2~0=~weak$$choice2~0_In1873273495} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-26 22:19:34,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 22:19:34,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In389134209 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In389134209 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out389134209|) (not .cse1)) (and (= ~a$w_buff0_used~0_In389134209 |P0Thread1of1ForFork0_#t~ite5_Out389134209|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In389134209, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In389134209} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out389134209|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In389134209, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In389134209} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:19:34,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2035391730 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-2035391730 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-2035391730 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2035391730 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2035391730| ~a$w_buff1_used~0_In-2035391730) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2035391730| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2035391730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035391730, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2035391730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035391730} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2035391730|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2035391730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035391730, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2035391730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035391730} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:19:34,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1142235786 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1142235786 256)))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1142235786 0)) (and (= ~a$r_buff0_thd1~0_In-1142235786 ~a$r_buff0_thd1~0_Out-1142235786) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1142235786, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1142235786} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1142235786|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1142235786, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1142235786} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:19:34,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1403219684 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1403219684 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In1403219684 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1403219684 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1403219684| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd1~0_In1403219684 |P0Thread1of1ForFork0_#t~ite8_Out1403219684|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1403219684, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1403219684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1403219684, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1403219684} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1403219684, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1403219684|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1403219684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1403219684, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1403219684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:19:34,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:19:34,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:19:34,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1635171432 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1635171432 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out1635171432| |P1Thread1of1ForFork1_#t~ite33_Out1635171432|))) (or (and (= ~a$w_buff1~0_In1635171432 |P1Thread1of1ForFork1_#t~ite32_Out1635171432|) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1635171432| ~a~0_In1635171432) (or .cse0 .cse2) .cse1))) InVars {~a~0=~a~0_In1635171432, ~a$w_buff1~0=~a$w_buff1~0_In1635171432, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1635171432, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1635171432} OutVars{~a~0=~a~0_In1635171432, ~a$w_buff1~0=~a$w_buff1~0_In1635171432, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1635171432, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635171432|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1635171432|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1635171432} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:19:34,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1358874406 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1358874406 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1358874406|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1358874406 |P1Thread1of1ForFork1_#t~ite34_Out-1358874406|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1358874406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1358874406} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1358874406|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1358874406, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1358874406} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:19:34,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In909074387 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In909074387 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In909074387 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In909074387 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out909074387|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In909074387 |P1Thread1of1ForFork1_#t~ite35_Out909074387|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In909074387, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In909074387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In909074387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In909074387} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In909074387, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In909074387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In909074387, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out909074387|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In909074387} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:19:34,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In927732701 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In927732701 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out927732701| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out927732701| ~a$r_buff0_thd2~0_In927732701)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In927732701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In927732701} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In927732701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In927732701, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out927732701|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:19:34,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1124958980 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1124958980 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1124958980 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1124958980 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-1124958980| ~a$r_buff1_thd2~0_In-1124958980)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1124958980| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1124958980, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1124958980, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1124958980, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1124958980} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1124958980, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1124958980, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1124958980, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1124958980, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1124958980|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:19:34,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:19:34,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 22:19:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In2097826747 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2097826747 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2097826747| ~a$w_buff1~0_In2097826747)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2097826747| ~a~0_In2097826747)))) InVars {~a~0=~a~0_In2097826747, ~a$w_buff1~0=~a$w_buff1~0_In2097826747, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2097826747, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2097826747} OutVars{~a~0=~a~0_In2097826747, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2097826747|, ~a$w_buff1~0=~a$w_buff1~0_In2097826747, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2097826747, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2097826747} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:19:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:19:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In51391762 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In51391762 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out51391762| ~a$w_buff0_used~0_In51391762) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out51391762|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In51391762, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In51391762} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In51391762, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In51391762, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out51391762|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:19:34,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1808555738 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1808555738 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1808555738 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1808555738 256)))) (or (and (= ~a$w_buff1_used~0_In1808555738 |ULTIMATE.start_main_#t~ite43_Out1808555738|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite43_Out1808555738| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1808555738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808555738, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1808555738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808555738} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1808555738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808555738, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1808555738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1808555738, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1808555738|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:19:34,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-513174814 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-513174814 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-513174814|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-513174814 |ULTIMATE.start_main_#t~ite44_Out-513174814|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-513174814, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-513174814} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-513174814, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-513174814, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-513174814|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:19:34,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1574798108 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1574798108 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1574798108 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1574798108 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1574798108| ~a$r_buff1_thd0~0_In-1574798108)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1574798108| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1574798108, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1574798108, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1574798108, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1574798108} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1574798108, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1574798108, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1574798108, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1574798108, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1574798108|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:19:34,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:19:34,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:19:34 BasicIcfg [2019-12-26 22:19:34,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:19:34,848 INFO L168 Benchmark]: Toolchain (without parser) took 16376.67 ms. Allocated memory was 145.2 MB in the beginning and 435.2 MB in the end (delta: 289.9 MB). Free memory was 99.9 MB in the beginning and 101.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 287.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,848 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.19 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 156.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.14 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,850 INFO L168 Benchmark]: Boogie Preprocessor took 37.09 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,850 INFO L168 Benchmark]: RCFGBuilder took 823.02 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 107.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,851 INFO L168 Benchmark]: TraceAbstraction took 14647.59 ms. Allocated memory was 202.9 MB in the beginning and 435.2 MB in the end (delta: 232.3 MB). Free memory was 106.6 MB in the beginning and 101.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 236.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:19:34,854 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.76 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.19 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 156.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.14 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.09 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.02 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 107.2 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14647.59 ms. Allocated memory was 202.9 MB in the beginning and 435.2 MB in the end (delta: 232.3 MB). Free memory was 106.6 MB in the beginning and 101.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 236.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2407 SDtfs, 2290 SDslu, 4415 SDs, 0 SdLazy, 2467 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 5198 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 107217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...