/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:35:51,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:35:51,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:35:51,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:35:51,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:35:51,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:35:51,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:35:51,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:35:51,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:35:51,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:35:51,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:35:51,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:35:51,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:35:51,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:35:51,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:35:51,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:35:51,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:35:51,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:35:51,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:35:51,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:35:51,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:35:51,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:35:51,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:35:51,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:35:51,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:35:51,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:35:51,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:35:51,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:35:51,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:35:51,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:35:51,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:35:51,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:35:51,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:35:51,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:35:51,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:35:51,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:35:51,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:35:51,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:35:51,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:35:51,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:35:51,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:35:51,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:35:51,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:35:51,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:35:51,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:35:51,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:35:51,152 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:35:51,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:35:51,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:35:51,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:35:51,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:35:51,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:35:51,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:35:51,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:35:51,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:35:51,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:35:51,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:35:51,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:35:51,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:35:51,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:35:51,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:35:51,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:35:51,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:35:51,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:35:51,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:35:51,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:35:51,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:35:51,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:35:51,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:35:51,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:35:51,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:35:51,448 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:35:51,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 07:35:51,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b3ef1c1/53857f5397ab458e93da007253523c9a/FLAGcd6309a49 [2019-12-27 07:35:52,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:35:52,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 07:35:52,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b3ef1c1/53857f5397ab458e93da007253523c9a/FLAGcd6309a49 [2019-12-27 07:35:52,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b3ef1c1/53857f5397ab458e93da007253523c9a [2019-12-27 07:35:52,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:35:52,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:35:52,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:52,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:35:52,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:35:52,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:52" (1/1) ... [2019-12-27 07:35:52,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edc5a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:52, skipping insertion in model container [2019-12-27 07:35:52,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:52" (1/1) ... [2019-12-27 07:35:52,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:35:52,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:35:53,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:53,162 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:35:53,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:53,303 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:35:53,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53 WrapperNode [2019-12-27 07:35:53,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:53,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:53,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:35:53,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:35:53,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:53,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:35:53,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:35:53,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:35:53,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... [2019-12-27 07:35:53,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:35:53,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:35:53,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:35:53,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:35:53,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:35:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:35:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:35:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:35:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:35:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:35:53,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:35:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:35:53,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:35:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:35:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:35:53,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:35:53,493 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:35:54,226 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:35:54,226 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:35:54,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:54 BoogieIcfgContainer [2019-12-27 07:35:54,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:35:54,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:35:54,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:35:54,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:35:54,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:35:52" (1/3) ... [2019-12-27 07:35:54,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:54, skipping insertion in model container [2019-12-27 07:35:54,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:53" (2/3) ... [2019-12-27 07:35:54,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:54, skipping insertion in model container [2019-12-27 07:35:54,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:54" (3/3) ... [2019-12-27 07:35:54,241 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-27 07:35:54,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:35:54,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:35:54,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:35:54,264 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:35:54,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,308 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,308 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,308 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:54,362 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:35:54,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:35:54,384 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:35:54,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:35:54,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:35:54,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:35:54,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:35:54,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:35:54,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:35:54,402 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 07:35:54,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:54,511 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:54,512 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:54,527 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:54,548 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:54,592 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:54,592 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:54,599 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:54,612 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 07:35:54,613 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:35:56,102 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-27 07:35:57,686 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 07:35:57,808 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 07:35:57,808 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 07:35:57,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:35:58,420 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 07:35:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 07:35:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:35:58,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:58,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:35:58,435 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 07:35:58,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:58,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013615395] [2019-12-27 07:35:58,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013615395] [2019-12-27 07:35:58,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:58,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:35:58,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747239803] [2019-12-27 07:35:58,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:58,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:58,687 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 07:35:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:58,929 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 07:35:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:58,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:35:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:59,022 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 07:35:59,022 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 07:35:59,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 07:35:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 07:35:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 07:35:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 07:35:59,567 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 07:35:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:59,567 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 07:35:59,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 07:35:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:35:59,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:59,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:35:59,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 07:35:59,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:59,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994192282] [2019-12-27 07:35:59,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:59,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994192282] [2019-12-27 07:35:59,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:59,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:59,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979608045] [2019-12-27 07:35:59,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:35:59,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:35:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:35:59,697 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 07:36:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:00,101 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 07:36:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:00,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:36:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:00,195 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 07:36:00,195 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 07:36:00,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 07:36:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 07:36:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 07:36:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 07:36:01,340 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 07:36:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:01,344 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 07:36:01,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 07:36:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:36:01,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:01,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:01,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 07:36:01,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:01,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575182192] [2019-12-27 07:36:01,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:01,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575182192] [2019-12-27 07:36:01,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:01,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:01,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655783709] [2019-12-27 07:36:01,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:01,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:01,481 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 07:36:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:01,766 INFO L93 Difference]: Finished difference Result 16164 states and 50739 transitions. [2019-12-27 07:36:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:01,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:36:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:01,809 INFO L225 Difference]: With dead ends: 16164 [2019-12-27 07:36:01,810 INFO L226 Difference]: Without dead ends: 16164 [2019-12-27 07:36:01,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2019-12-27 07:36:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 14464. [2019-12-27 07:36:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2019-12-27 07:36:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 45803 transitions. [2019-12-27 07:36:02,335 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 45803 transitions. Word has length 11 [2019-12-27 07:36:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:02,336 INFO L462 AbstractCegarLoop]: Abstraction has 14464 states and 45803 transitions. [2019-12-27 07:36:02,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 45803 transitions. [2019-12-27 07:36:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:36:02,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:02,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:02,341 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1340562840, now seen corresponding path program 1 times [2019-12-27 07:36:02,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:02,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834149149] [2019-12-27 07:36:02,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:02,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834149149] [2019-12-27 07:36:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:02,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154354971] [2019-12-27 07:36:02,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:02,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:02,414 INFO L87 Difference]: Start difference. First operand 14464 states and 45803 transitions. Second operand 5 states. [2019-12-27 07:36:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:02,909 INFO L93 Difference]: Finished difference Result 19369 states and 59796 transitions. [2019-12-27 07:36:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:36:02,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:36:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:02,974 INFO L225 Difference]: With dead ends: 19369 [2019-12-27 07:36:02,974 INFO L226 Difference]: Without dead ends: 19362 [2019-12-27 07:36:02,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:36:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19362 states. [2019-12-27 07:36:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19362 to 14438. [2019-12-27 07:36:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-27 07:36:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45411 transitions. [2019-12-27 07:36:03,614 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45411 transitions. Word has length 17 [2019-12-27 07:36:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:03,614 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45411 transitions. [2019-12-27 07:36:03,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45411 transitions. [2019-12-27 07:36:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:36:03,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:03,629 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-27 07:36:03,629 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1840046616, now seen corresponding path program 1 times [2019-12-27 07:36:03,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:03,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397299345] [2019-12-27 07:36:03,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:03,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397299345] [2019-12-27 07:36:03,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:03,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:03,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182818246] [2019-12-27 07:36:03,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:03,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:03,677 INFO L87 Difference]: Start difference. First operand 14438 states and 45411 transitions. Second operand 3 states. [2019-12-27 07:36:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:03,811 INFO L93 Difference]: Finished difference Result 17602 states and 54691 transitions. [2019-12-27 07:36:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:03,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:36:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:03,847 INFO L225 Difference]: With dead ends: 17602 [2019-12-27 07:36:03,847 INFO L226 Difference]: Without dead ends: 17602 [2019-12-27 07:36:03,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-12-27 07:36:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 15582. [2019-12-27 07:36:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15582 states. [2019-12-27 07:36:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 48928 transitions. [2019-12-27 07:36:04,970 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 48928 transitions. Word has length 25 [2019-12-27 07:36:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:04,970 INFO L462 AbstractCegarLoop]: Abstraction has 15582 states and 48928 transitions. [2019-12-27 07:36:04,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 48928 transitions. [2019-12-27 07:36:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:36:04,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:04,987 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-27 07:36:04,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1840202205, now seen corresponding path program 1 times [2019-12-27 07:36:04,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:04,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29959459] [2019-12-27 07:36:04,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:05,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29959459] [2019-12-27 07:36:05,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:05,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890853932] [2019-12-27 07:36:05,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:05,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:05,061 INFO L87 Difference]: Start difference. First operand 15582 states and 48928 transitions. Second operand 4 states. [2019-12-27 07:36:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,094 INFO L93 Difference]: Finished difference Result 2444 states and 5542 transitions. [2019-12-27 07:36:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:36:05,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:36:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,098 INFO L225 Difference]: With dead ends: 2444 [2019-12-27 07:36:05,098 INFO L226 Difference]: Without dead ends: 2145 [2019-12-27 07:36:05,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-27 07:36:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2019-12-27 07:36:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 07:36:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 07:36:05,132 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 25 [2019-12-27 07:36:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,133 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 07:36:05,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 07:36:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:36:05,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,136 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] [2019-12-27 07:36:05,136 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 07:36:05,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443581675] [2019-12-27 07:36:05,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:05,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443581675] [2019-12-27 07:36:05,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:36:05,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201600109] [2019-12-27 07:36:05,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:05,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:05,270 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 07:36:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,312 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 07:36:05,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:05,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:36:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,314 INFO L225 Difference]: With dead ends: 443 [2019-12-27 07:36:05,314 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 07:36:05,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:36:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 07:36:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 07:36:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 07:36:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 07:36:05,322 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 07:36:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 07:36:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 07:36:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:36:05,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,324 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-27 07:36:05,324 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 07:36:05,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52645068] [2019-12-27 07:36:05,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:05,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52645068] [2019-12-27 07:36:05,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:05,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866139456] [2019-12-27 07:36:05,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:05,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:05,447 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 3 states. [2019-12-27 07:36:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,462 INFO L93 Difference]: Finished difference Result 332 states and 584 transitions. [2019-12-27 07:36:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:05,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:36:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,463 INFO L225 Difference]: With dead ends: 332 [2019-12-27 07:36:05,463 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 07:36:05,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 07:36:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-12-27 07:36:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:36:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 07:36:05,469 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 07:36:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,471 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 07:36:05,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 07:36:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:36:05,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,472 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-27 07:36:05,473 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 07:36:05,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671704870] [2019-12-27 07:36:05,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:05,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671704870] [2019-12-27 07:36:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:36:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9942327] [2019-12-27 07:36:05,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:05,592 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 07:36:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,780 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 07:36:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:36:05,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 07:36:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,781 INFO L225 Difference]: With dead ends: 488 [2019-12-27 07:36:05,781 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 07:36:05,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:36:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 07:36:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 07:36:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 07:36:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 07:36:05,786 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 07:36:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 07:36:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 07:36:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:36:05,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,788 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-27 07:36:05,788 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 07:36:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013118718] [2019-12-27 07:36:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013118718] [2019-12-27 07:36:05,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:05,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148339991] [2019-12-27 07:36:05,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:05,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:05,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:05,904 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 07:36:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,951 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 07:36:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:05,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:36:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,952 INFO L225 Difference]: With dead ends: 423 [2019-12-27 07:36:05,952 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 07:36:05,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 07:36:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 07:36:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:36:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 07:36:05,959 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 07:36:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,959 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 07:36:05,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 07:36:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:05,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:05,961 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 07:36:05,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453153172] [2019-12-27 07:36:05,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:06,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453153172] [2019-12-27 07:36:06,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:06,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:36:06,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863057389] [2019-12-27 07:36:06,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:36:06,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:36:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:36:06,104 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 7 states. [2019-12-27 07:36:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:06,183 INFO L93 Difference]: Finished difference Result 536 states and 942 transitions. [2019-12-27 07:36:06,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:36:06,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:36:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:06,184 INFO L225 Difference]: With dead ends: 536 [2019-12-27 07:36:06,184 INFO L226 Difference]: Without dead ends: 246 [2019-12-27 07:36:06,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:36:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-27 07:36:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 222. [2019-12-27 07:36:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 07:36:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 07:36:06,190 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 07:36:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:06,191 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 07:36:06,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:36:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 07:36:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:06,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:06,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:06,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 07:36:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:06,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816167309] [2019-12-27 07:36:06,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:06,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816167309] [2019-12-27 07:36:06,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:06,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:36:06,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677610669] [2019-12-27 07:36:06,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:36:06,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:06,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:36:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:36:06,720 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 13 states. [2019-12-27 07:36:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:07,348 INFO L93 Difference]: Finished difference Result 390 states and 669 transitions. [2019-12-27 07:36:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:36:07,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:36:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:07,350 INFO L225 Difference]: With dead ends: 390 [2019-12-27 07:36:07,350 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 07:36:07,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 07:36:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 07:36:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 322. [2019-12-27 07:36:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 07:36:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 564 transitions. [2019-12-27 07:36:07,356 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 564 transitions. Word has length 54 [2019-12-27 07:36:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:07,357 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 564 transitions. [2019-12-27 07:36:07,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:36:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 564 transitions. [2019-12-27 07:36:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:07,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:07,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:07,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash -688648962, now seen corresponding path program 3 times [2019-12-27 07:36:07,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:07,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373762108] [2019-12-27 07:36:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:07,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373762108] [2019-12-27 07:36:07,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:07,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:36:07,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700736834] [2019-12-27 07:36:07,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:36:07,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:36:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:36:07,795 INFO L87 Difference]: Start difference. First operand 322 states and 564 transitions. Second operand 18 states. [2019-12-27 07:36:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:08,599 INFO L93 Difference]: Finished difference Result 628 states and 1073 transitions. [2019-12-27 07:36:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:36:08,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 07:36:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:08,600 INFO L225 Difference]: With dead ends: 628 [2019-12-27 07:36:08,600 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 07:36:08,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2019-12-27 07:36:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 07:36:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 344. [2019-12-27 07:36:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 07:36:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 606 transitions. [2019-12-27 07:36:08,606 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 606 transitions. Word has length 54 [2019-12-27 07:36:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:08,606 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 606 transitions. [2019-12-27 07:36:08,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:36:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 606 transitions. [2019-12-27 07:36:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:08,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:08,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:08,608 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1502015610, now seen corresponding path program 4 times [2019-12-27 07:36:08,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:08,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613410996] [2019-12-27 07:36:08,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:08,833 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 07:36:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:09,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613410996] [2019-12-27 07:36:09,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:09,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:36:09,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927609658] [2019-12-27 07:36:09,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:36:09,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:36:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:36:09,085 INFO L87 Difference]: Start difference. First operand 344 states and 606 transitions. Second operand 17 states. [2019-12-27 07:36:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:10,284 INFO L93 Difference]: Finished difference Result 634 states and 1079 transitions. [2019-12-27 07:36:10,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:36:10,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 07:36:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:10,285 INFO L225 Difference]: With dead ends: 634 [2019-12-27 07:36:10,286 INFO L226 Difference]: Without dead ends: 600 [2019-12-27 07:36:10,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2019-12-27 07:36:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-27 07:36:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 342. [2019-12-27 07:36:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 07:36:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 602 transitions. [2019-12-27 07:36:10,292 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 602 transitions. Word has length 54 [2019-12-27 07:36:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:10,293 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 602 transitions. [2019-12-27 07:36:10,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:36:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 602 transitions. [2019-12-27 07:36:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:10,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:10,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:10,294 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1610296860, now seen corresponding path program 5 times [2019-12-27 07:36:10,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:10,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656544872] [2019-12-27 07:36:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656544872] [2019-12-27 07:36:10,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:36:10,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371634842] [2019-12-27 07:36:10,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:36:10,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:36:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:36:10,500 INFO L87 Difference]: Start difference. First operand 342 states and 602 transitions. Second operand 13 states. [2019-12-27 07:36:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:10,779 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-27 07:36:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:36:10,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:36:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:10,781 INFO L225 Difference]: With dead ends: 446 [2019-12-27 07:36:10,781 INFO L226 Difference]: Without dead ends: 412 [2019-12-27 07:36:10,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:36:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-12-27 07:36:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 330. [2019-12-27 07:36:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 07:36:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 07:36:10,787 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 07:36:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:10,788 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 07:36:10,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:36:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 07:36:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:10,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:10,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:10,789 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 6 times [2019-12-27 07:36:10,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:10,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113307151] [2019-12-27 07:36:10,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:36:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:36:10,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:36:10,905 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:36:10,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t2017~0.offset_19|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24| 1)) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2017~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2017~0.base_24|) |v_ULTIMATE.start_main_~#t2017~0.offset_19| 0)) |v_#memory_int_9|) (= v_~y~0_29 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2017~0.base_24|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2017~0.base_24| 4)) (= 0 v_~y$r_buff1_thd0~0_50) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ULTIMATE.start_main_~#t2017~0.base=|v_ULTIMATE.start_main_~#t2017~0.base_24|, #length=|v_#length_11|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2017~0.offset=|v_ULTIMATE.start_main_~#t2017~0.offset_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2017~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2018~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2018~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t2017~0.offset, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:36:10,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) |v_ULTIMATE.start_main_~#t2018~0.offset_10| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2018~0.base_11| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t2018~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2018~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2018~0.offset, #length] because there is no mapped edge [2019-12-27 07:36:10,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:36:10,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1965248880 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1965248880 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1965248880 |P1Thread1of1ForFork1_#t~ite9_Out-1965248880|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1965248880| ~y~0_In-1965248880) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1965248880, ~y$w_buff1~0=~y$w_buff1~0_In-1965248880, ~y~0=~y~0_In-1965248880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1965248880} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1965248880, ~y$w_buff1~0=~y$w_buff1~0_In-1965248880, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1965248880|, ~y~0=~y~0_In-1965248880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1965248880} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:36:10,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:36:10,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-753937231 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-753937231 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-753937231|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-753937231 |P1Thread1of1ForFork1_#t~ite11_Out-753937231|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-753937231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-753937231} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-753937231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-753937231, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-753937231|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:36:10,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2116216485 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2116216485 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2116216485 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2116216485 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out2116216485| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out2116216485| ~y$w_buff1_used~0_In2116216485) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2116216485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116216485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116216485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2116216485} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2116216485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116216485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116216485, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2116216485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2116216485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:36:10,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1368998899 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1368998899 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1368998899|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1368998899| ~y$r_buff0_thd2~0_In-1368998899) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1368998899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1368998899} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1368998899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1368998899, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1368998899|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:36:10,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1382025180 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1382025180 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1382025180 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1382025180 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1382025180|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-1382025180 |P1Thread1of1ForFork1_#t~ite14_Out-1382025180|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1382025180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382025180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382025180, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382025180} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1382025180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382025180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382025180, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1382025180|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382025180} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:36:10,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:36:10,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1336650287 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1336650287 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1336650287| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1336650287 |P0Thread1of1ForFork0_#t~ite5_Out-1336650287|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1336650287, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1336650287} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1336650287|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1336650287, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1336650287} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:36:10,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-319095065 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-319095065 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-319095065 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-319095065 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-319095065| ~y$w_buff1_used~0_In-319095065) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-319095065| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-319095065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-319095065, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-319095065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319095065} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-319095065|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-319095065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-319095065, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-319095065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319095065} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:36:10,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In274315056 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In274315056 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out274315056) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In274315056 ~y$r_buff0_thd1~0_Out274315056) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In274315056, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In274315056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In274315056, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out274315056|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out274315056} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:36:10,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1585311122 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1585311122 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1585311122 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1585311122 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1585311122| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1585311122| ~y$r_buff1_thd1~0_In-1585311122)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1585311122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1585311122, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1585311122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1585311122} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1585311122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1585311122, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1585311122|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1585311122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1585311122} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:36:10,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:36:10,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:36:10,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-133795761 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-133795761 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out-133795761| |ULTIMATE.start_main_#t~ite18_Out-133795761|))) (or (and (= ~y~0_In-133795761 |ULTIMATE.start_main_#t~ite17_Out-133795761|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-133795761| ~y$w_buff1~0_In-133795761) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-133795761, ~y~0=~y~0_In-133795761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-133795761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-133795761} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-133795761|, ~y$w_buff1~0=~y$w_buff1~0_In-133795761, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-133795761|, ~y~0=~y~0_In-133795761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-133795761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-133795761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 07:36:10,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1174367703 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1174367703 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1174367703 |ULTIMATE.start_main_#t~ite19_Out1174367703|)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out1174367703|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1174367703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1174367703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1174367703, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1174367703|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1174367703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:36:10,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2101858017 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2101858017 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2101858017 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2101858017 256)))) (or (and (= ~y$w_buff1_used~0_In-2101858017 |ULTIMATE.start_main_#t~ite20_Out-2101858017|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out-2101858017| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101858017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2101858017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2101858017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2101858017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101858017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2101858017, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2101858017|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2101858017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2101858017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:36:10,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1270293164 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1270293164 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1270293164 |ULTIMATE.start_main_#t~ite21_Out1270293164|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1270293164|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1270293164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1270293164} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1270293164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1270293164, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1270293164|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:36:10,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In2129830265 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2129830265 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2129830265 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2129830265 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out2129830265| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out2129830265| ~y$r_buff1_thd0~0_In2129830265) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2129830265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2129830265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2129830265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2129830265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2129830265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2129830265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2129830265, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2129830265|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2129830265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:36:10,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2014250154 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-2014250154| |ULTIMATE.start_main_#t~ite32_Out-2014250154|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2014250154 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-2014250154 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2014250154 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2014250154 256))))) .cse1 (= |ULTIMATE.start_main_#t~ite31_Out-2014250154| ~y$w_buff1~0_In-2014250154)) (and (= |ULTIMATE.start_main_#t~ite31_In-2014250154| |ULTIMATE.start_main_#t~ite31_Out-2014250154|) (= ~y$w_buff1~0_In-2014250154 |ULTIMATE.start_main_#t~ite32_Out-2014250154|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2014250154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014250154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2014250154, ~weak$$choice2~0=~weak$$choice2~0_In-2014250154, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2014250154|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2014250154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014250154} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2014250154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014250154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2014250154, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2014250154|, ~weak$$choice2~0=~weak$$choice2~0_In-2014250154, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2014250154|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2014250154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014250154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 07:36:10,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 07:36:10,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:36:10,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:36:10,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:36:10 BasicIcfg [2019-12-27 07:36:10,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:36:11,003 INFO L168 Benchmark]: Toolchain (without parser) took 18567.95 ms. Allocated memory was 145.2 MB in the beginning and 818.9 MB in the end (delta: 673.7 MB). Free memory was 101.3 MB in the beginning and 360.2 MB in the end (delta: -258.9 MB). Peak memory consumption was 414.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,003 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.10 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 155.2 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.90 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,012 INFO L168 Benchmark]: Boogie Preprocessor took 39.07 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,013 INFO L168 Benchmark]: RCFGBuilder took 804.59 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 105.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,013 INFO L168 Benchmark]: TraceAbstraction took 16768.91 ms. Allocated memory was 202.9 MB in the beginning and 818.9 MB in the end (delta: 616.0 MB). Free memory was 105.3 MB in the beginning and 360.2 MB in the end (delta: -254.8 MB). Peak memory consumption was 361.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:11,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 871.10 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 155.2 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.90 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.07 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.59 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 105.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16768.91 ms. Allocated memory was 202.9 MB in the beginning and 818.9 MB in the end (delta: 616.0 MB). Free memory was 105.3 MB in the beginning and 360.2 MB in the end (delta: -254.8 MB). Peak memory consumption was 361.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1589 SDtfs, 1713 SDslu, 4746 SDs, 0 SdLazy, 3131 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15582occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 10716 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 147639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...