/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:08,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:08,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:08,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:08,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:08,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:08,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:08,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:08,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:08,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:08,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:08,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:08,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:08,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:08,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:08,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:08,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:08,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:08,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:08,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:08,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:08,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:08,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:08,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:08,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:08,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:08,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:08,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:08,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:08,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:08,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:08,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:08,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:08,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:08,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:08,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:08,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:08,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:08,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:08,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:08,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:08,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:09:08,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:08,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:08,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:08,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:08,265 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:08,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:08,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:08,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:08,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:08,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:08,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:08,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:08,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:08,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:08,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:08,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:08,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:08,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:08,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:08,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:08,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:08,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:08,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:08,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:08,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:08,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:08,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:08,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:08,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:08,551 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:08,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-18 15:09:08,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f5bf1cf/29e2b0597ee9482e9803c75e385575f3/FLAG7aa3a2cd0 [2019-12-18 15:09:09,252 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:09,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-18 15:09:09,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f5bf1cf/29e2b0597ee9482e9803c75e385575f3/FLAG7aa3a2cd0 [2019-12-18 15:09:09,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f5bf1cf/29e2b0597ee9482e9803c75e385575f3 [2019-12-18 15:09:09,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:09,556 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:09,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:09,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:09,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:09,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:09" (1/1) ... [2019-12-18 15:09:09,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779836a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:09, skipping insertion in model container [2019-12-18 15:09:09,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:09" (1/1) ... [2019-12-18 15:09:09,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:09,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:10,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:10,196 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:10,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:10,346 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:10,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10 WrapperNode [2019-12-18 15:09:10,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:10,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:10,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:10,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:10,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:10,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:10,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:10,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:10,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... [2019-12-18 15:09:10,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:10,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:10,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:10,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:10,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:10,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:10,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:10,541 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:09:11,262 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:11,262 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:11,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:11 BoogieIcfgContainer [2019-12-18 15:09:11,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:11,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:11,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:11,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:11,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:09" (1/3) ... [2019-12-18 15:09:11,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb4e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:11, skipping insertion in model container [2019-12-18 15:09:11,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:10" (2/3) ... [2019-12-18 15:09:11,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb4e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:11, skipping insertion in model container [2019-12-18 15:09:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:11" (3/3) ... [2019-12-18 15:09:11,273 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2019-12-18 15:09:11,284 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:11,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:11,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:11,294 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:11,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,344 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,344 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,357 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,358 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,367 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:11,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:11,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:11,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:11,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:11,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:11,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:11,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:11,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:11,409 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:11,426 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-18 15:09:11,429 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:11,546 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:11,546 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:11,564 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:11,586 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:11,649 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:11,650 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:11,655 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:11,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:11,671 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:16,994 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 15:09:17,124 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 15:09:17,144 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-18 15:09:17,144 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 15:09:17,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-18 15:09:18,077 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-18 15:09:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-18 15:09:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:09:18,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:18,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:18,088 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-18 15:09:18,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:18,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977661249] [2019-12-18 15:09:18,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:18,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977661249] [2019-12-18 15:09:18,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:18,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:18,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067078008] [2019-12-18 15:09:18,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:18,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:18,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:18,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:18,389 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-18 15:09:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:18,804 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-18 15:09:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:18,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:09:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:19,041 INFO L225 Difference]: With dead ends: 15586 [2019-12-18 15:09:19,042 INFO L226 Difference]: Without dead ends: 15248 [2019-12-18 15:09:19,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-18 15:09:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-18 15:09:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-18 15:09:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-18 15:09:20,330 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-18 15:09:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:20,331 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-18 15:09:20,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-18 15:09:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:20,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:20,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:20,344 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-18 15:09:20,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:20,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224649742] [2019-12-18 15:09:20,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:20,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224649742] [2019-12-18 15:09:20,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:20,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:20,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711191137] [2019-12-18 15:09:20,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:20,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:20,523 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-18 15:09:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:21,308 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-18 15:09:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:21,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:21,412 INFO L225 Difference]: With dead ends: 24364 [2019-12-18 15:09:21,413 INFO L226 Difference]: Without dead ends: 24350 [2019-12-18 15:09:21,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-18 15:09:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-18 15:09:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-18 15:09:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-18 15:09:23,219 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-18 15:09:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:23,220 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-18 15:09:23,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-18 15:09:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:23,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:23,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:23,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-18 15:09:23,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:23,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012073255] [2019-12-18 15:09:23,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:23,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012073255] [2019-12-18 15:09:23,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:23,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:23,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153041822] [2019-12-18 15:09:23,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:23,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:23,271 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-18 15:09:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:23,344 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-18 15:09:23,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:23,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:09:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:23,385 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 15:09:23,385 INFO L226 Difference]: Without dead ends: 12388 [2019-12-18 15:09:23,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-18 15:09:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-18 15:09:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-18 15:09:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-18 15:09:23,716 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-18 15:09:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:23,717 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-18 15:09:23,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-18 15:09:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:09:23,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:23,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:23,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-18 15:09:23,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:23,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002612325] [2019-12-18 15:09:23,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:23,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002612325] [2019-12-18 15:09:23,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:23,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:23,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763636055] [2019-12-18 15:09:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:23,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:23,777 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-18 15:09:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:23,803 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-18 15:09:23,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:23,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:09:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:23,811 INFO L225 Difference]: With dead ends: 1903 [2019-12-18 15:09:23,811 INFO L226 Difference]: Without dead ends: 1903 [2019-12-18 15:09:23,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-18 15:09:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-18 15:09:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-18 15:09:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-18 15:09:23,848 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-18 15:09:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:23,848 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-18 15:09:23,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-18 15:09:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:09:23,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:23,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:23,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-18 15:09:23,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:23,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560616904] [2019-12-18 15:09:23,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:23,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560616904] [2019-12-18 15:09:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:23,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:23,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228241203] [2019-12-18 15:09:23,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:23,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:23,995 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-18 15:09:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:24,026 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-18 15:09:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:24,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:09:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:24,029 INFO L225 Difference]: With dead ends: 669 [2019-12-18 15:09:24,029 INFO L226 Difference]: Without dead ends: 669 [2019-12-18 15:09:24,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-18 15:09:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-18 15:09:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 15:09:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-18 15:09:24,041 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-18 15:09:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:24,041 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-18 15:09:24,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-18 15:09:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:24,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:24,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:24,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:24,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-18 15:09:24,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:24,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558427288] [2019-12-18 15:09:24,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:24,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558427288] [2019-12-18 15:09:24,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:24,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:24,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470897470] [2019-12-18 15:09:24,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:24,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:24,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:24,266 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-18 15:09:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:24,306 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-18 15:09:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:24,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:09:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:24,309 INFO L225 Difference]: With dead ends: 610 [2019-12-18 15:09:24,310 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 15:09:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 15:09:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-18 15:09:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:09:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-18 15:09:24,321 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-18 15:09:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:24,321 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-18 15:09:24,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-18 15:09:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:24,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:24,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:24,325 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-18 15:09:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:24,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740202949] [2019-12-18 15:09:24,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:24,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740202949] [2019-12-18 15:09:24,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:24,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:24,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650436785] [2019-12-18 15:09:24,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:24,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:24,542 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 6 states. [2019-12-18 15:09:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:24,897 INFO L93 Difference]: Finished difference Result 958 states and 2233 transitions. [2019-12-18 15:09:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:09:24,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:09:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:24,901 INFO L225 Difference]: With dead ends: 958 [2019-12-18 15:09:24,902 INFO L226 Difference]: Without dead ends: 958 [2019-12-18 15:09:24,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:09:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-12-18 15:09:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 763. [2019-12-18 15:09:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-18 15:09:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1794 transitions. [2019-12-18 15:09:24,916 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1794 transitions. Word has length 54 [2019-12-18 15:09:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:24,917 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1794 transitions. [2019-12-18 15:09:24,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1794 transitions. [2019-12-18 15:09:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:24,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:24,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:24,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:24,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1569420555, now seen corresponding path program 2 times [2019-12-18 15:09:24,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:24,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666183251] [2019-12-18 15:09:24,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:25,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666183251] [2019-12-18 15:09:25,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:25,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:25,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277537078] [2019-12-18 15:09:25,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:25,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:25,037 INFO L87 Difference]: Start difference. First operand 763 states and 1794 transitions. Second operand 6 states. [2019-12-18 15:09:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:25,405 INFO L93 Difference]: Finished difference Result 1306 states and 3046 transitions. [2019-12-18 15:09:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:09:25,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:09:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:25,409 INFO L225 Difference]: With dead ends: 1306 [2019-12-18 15:09:25,410 INFO L226 Difference]: Without dead ends: 1306 [2019-12-18 15:09:25,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-12-18 15:09:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 841. [2019-12-18 15:09:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-18 15:09:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1991 transitions. [2019-12-18 15:09:25,435 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1991 transitions. Word has length 54 [2019-12-18 15:09:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1991 transitions. [2019-12-18 15:09:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1991 transitions. [2019-12-18 15:09:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:25,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:25,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:25,442 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash 342220965, now seen corresponding path program 3 times [2019-12-18 15:09:25,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:25,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46765965] [2019-12-18 15:09:25,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:25,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46765965] [2019-12-18 15:09:25,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:25,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:09:25,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993670662] [2019-12-18 15:09:25,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:09:25,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:09:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:25,645 INFO L87 Difference]: Start difference. First operand 841 states and 1991 transitions. Second operand 8 states. [2019-12-18 15:09:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:26,074 INFO L93 Difference]: Finished difference Result 1322 states and 3084 transitions. [2019-12-18 15:09:26,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:09:26,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 15:09:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:26,077 INFO L225 Difference]: With dead ends: 1322 [2019-12-18 15:09:26,078 INFO L226 Difference]: Without dead ends: 1322 [2019-12-18 15:09:26,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:09:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-18 15:09:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 799. [2019-12-18 15:09:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-18 15:09:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1888 transitions. [2019-12-18 15:09:26,095 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1888 transitions. Word has length 54 [2019-12-18 15:09:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:26,096 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1888 transitions. [2019-12-18 15:09:26,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:09:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1888 transitions. [2019-12-18 15:09:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:26,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:26,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:26,099 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 234191309, now seen corresponding path program 1 times [2019-12-18 15:09:26,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:26,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311180404] [2019-12-18 15:09:26,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:26,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311180404] [2019-12-18 15:09:26,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:26,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:26,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839750438] [2019-12-18 15:09:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:26,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:26,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:26,194 INFO L87 Difference]: Start difference. First operand 799 states and 1888 transitions. Second operand 3 states. [2019-12-18 15:09:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:26,208 INFO L93 Difference]: Finished difference Result 763 states and 1764 transitions. [2019-12-18 15:09:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:26,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:26,210 INFO L225 Difference]: With dead ends: 763 [2019-12-18 15:09:26,210 INFO L226 Difference]: Without dead ends: 763 [2019-12-18 15:09:26,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-18 15:09:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2019-12-18 15:09:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-18 15:09:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1764 transitions. [2019-12-18 15:09:26,222 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1764 transitions. Word has length 55 [2019-12-18 15:09:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:26,225 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1764 transitions. [2019-12-18 15:09:26,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1764 transitions. [2019-12-18 15:09:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:26,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:26,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:26,228 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2008175174, now seen corresponding path program 1 times [2019-12-18 15:09:26,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:26,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533764612] [2019-12-18 15:09:26,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:26,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533764612] [2019-12-18 15:09:26,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:26,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:26,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96345859] [2019-12-18 15:09:26,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:26,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:26,340 INFO L87 Difference]: Start difference. First operand 763 states and 1764 transitions. Second operand 3 states. [2019-12-18 15:09:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:26,380 INFO L93 Difference]: Finished difference Result 763 states and 1763 transitions. [2019-12-18 15:09:26,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:26,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:26,382 INFO L225 Difference]: With dead ends: 763 [2019-12-18 15:09:26,382 INFO L226 Difference]: Without dead ends: 763 [2019-12-18 15:09:26,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-18 15:09:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 498. [2019-12-18 15:09:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-18 15:09:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1149 transitions. [2019-12-18 15:09:26,394 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1149 transitions. Word has length 55 [2019-12-18 15:09:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:26,395 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1149 transitions. [2019-12-18 15:09:26,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1149 transitions. [2019-12-18 15:09:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:26,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:26,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:26,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash -529490788, now seen corresponding path program 1 times [2019-12-18 15:09:26,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:26,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380371623] [2019-12-18 15:09:26,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:26,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380371623] [2019-12-18 15:09:26,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:26,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:26,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061902391] [2019-12-18 15:09:26,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:26,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:26,578 INFO L87 Difference]: Start difference. First operand 498 states and 1149 transitions. Second operand 6 states. [2019-12-18 15:09:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:26,651 INFO L93 Difference]: Finished difference Result 892 states and 1870 transitions. [2019-12-18 15:09:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:26,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 15:09:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:26,653 INFO L225 Difference]: With dead ends: 892 [2019-12-18 15:09:26,653 INFO L226 Difference]: Without dead ends: 579 [2019-12-18 15:09:26,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-18 15:09:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 436. [2019-12-18 15:09:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 15:09:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-18 15:09:26,665 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 56 [2019-12-18 15:09:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:26,666 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-18 15:09:26,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-18 15:09:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:26,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:26,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:26,668 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 2 times [2019-12-18 15:09:26,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:26,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083367185] [2019-12-18 15:09:26,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:26,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083367185] [2019-12-18 15:09:26,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:26,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:26,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951741581] [2019-12-18 15:09:26,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:26,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:26,830 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 6 states. [2019-12-18 15:09:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:26,955 INFO L93 Difference]: Finished difference Result 707 states and 1527 transitions. [2019-12-18 15:09:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:26,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 15:09:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:26,957 INFO L225 Difference]: With dead ends: 707 [2019-12-18 15:09:26,957 INFO L226 Difference]: Without dead ends: 244 [2019-12-18 15:09:26,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-18 15:09:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-18 15:09:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 15:09:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-18 15:09:26,964 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-18 15:09:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:26,964 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-18 15:09:26,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-18 15:09:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:26,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:26,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:26,965 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 3 times [2019-12-18 15:09:26,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:26,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179026246] [2019-12-18 15:09:26,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:27,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179026246] [2019-12-18 15:09:27,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:27,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:09:27,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995144562] [2019-12-18 15:09:27,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:09:27,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:09:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:27,221 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 14 states. [2019-12-18 15:09:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:27,834 INFO L93 Difference]: Finished difference Result 392 states and 672 transitions. [2019-12-18 15:09:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:09:27,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 15:09:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:27,836 INFO L225 Difference]: With dead ends: 392 [2019-12-18 15:09:27,836 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 15:09:27,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:09:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 15:09:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 320. [2019-12-18 15:09:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 15:09:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-18 15:09:27,843 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-18 15:09:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:27,843 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-18 15:09:27,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:09:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-18 15:09:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:27,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:27,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:27,845 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 4 times [2019-12-18 15:09:27,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:27,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907284567] [2019-12-18 15:09:27,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:28,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907284567] [2019-12-18 15:09:28,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:28,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:09:28,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669922321] [2019-12-18 15:09:28,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:09:28,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:09:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:28,112 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 14 states. [2019-12-18 15:09:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:28,659 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2019-12-18 15:09:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:09:28,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 15:09:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:28,660 INFO L225 Difference]: With dead ends: 428 [2019-12-18 15:09:28,660 INFO L226 Difference]: Without dead ends: 398 [2019-12-18 15:09:28,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:09:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-18 15:09:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 328. [2019-12-18 15:09:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 15:09:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-18 15:09:28,667 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-18 15:09:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:28,667 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-18 15:09:28,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:09:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-18 15:09:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:28,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:28,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:28,669 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 5 times [2019-12-18 15:09:28,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:28,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872821284] [2019-12-18 15:09:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:28,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:28,773 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:28,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_54) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2504~0.base_27|) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2504~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27|) |v_ULTIMATE.start_main_~#t2504~0.offset_20| 0)) |v_#memory_int_23|) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27| 1)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_cnt~0_90) (= 0 |v_ULTIMATE.start_main_~#t2504~0.offset_20|) (= v_~y$r_buff1_thd0~0_237 0) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2504~0.base=|v_ULTIMATE.start_main_~#t2504~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_~#t2504~0.offset=|v_ULTIMATE.start_main_~#t2504~0.offset_20|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2504~0.base, 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, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2504~0.offset, 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, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t2505~0.offset, ~__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_~#t2506~0.offset, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2506~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2505~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:28,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2505~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2505~0.base_9|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9| 1) |v_#valid_33|) (= |v_ULTIMATE.start_main_~#t2505~0.offset_9| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9|) |v_ULTIMATE.start_main_~#t2505~0.offset_9| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2505~0.offset, #length, ULTIMATE.start_main_~#t2505~0.base] because there is no mapped edge [2019-12-18 15:09:28,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t2506~0.offset_9| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10|) |v_ULTIMATE.start_main_~#t2506~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2506~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2506~0.base_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2506~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t2506~0.base, #length] because there is no mapped edge [2019-12-18 15:09:28,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0_#in~arg.offset_In-1050349025| P2Thread1of1ForFork0_~arg.offset_Out-1050349025) (= (mod ~y$w_buff1_used~0_Out-1050349025 256) 0) (= ~y$w_buff0~0_Out-1050349025 2) (= ~y$w_buff1~0_Out-1050349025 ~y$w_buff0~0_In-1050349025) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1050349025 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1050349025|) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1050349025| 1) (= 1 ~y$w_buff0_used~0_Out-1050349025) (= ~y$w_buff1_used~0_Out-1050349025 ~y$w_buff0_used~0_In-1050349025) (= |P2Thread1of1ForFork0_#in~arg.base_In-1050349025| P2Thread1of1ForFork0_~arg.base_Out-1050349025)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1050349025|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1050349025, ~y$w_buff0~0=~y$w_buff0~0_In-1050349025, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1050349025|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-1050349025, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1050349025|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-1050349025|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1050349025, ~y$w_buff1~0=~y$w_buff1~0_Out-1050349025, ~y$w_buff0~0=~y$w_buff0~0_Out-1050349025, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-1050349025, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-1050349025|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1050349025, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1050349025} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:28,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:09:28,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1342353076 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1342353076 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1342353076| ~y$w_buff0_used~0_In-1342353076)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1342353076| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1342353076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1342353076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1342353076, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1342353076|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1342353076} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:09:28,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1870454983 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1870454983| |P1Thread1of1ForFork2_#t~ite3_Out-1870454983|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1870454983 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-1870454983 |P1Thread1of1ForFork2_#t~ite3_Out-1870454983|)) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In-1870454983 |P1Thread1of1ForFork2_#t~ite3_Out-1870454983|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870454983, ~y$w_buff1~0=~y$w_buff1~0_In-1870454983, ~y~0=~y~0_In-1870454983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870454983} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1870454983, ~y$w_buff1~0=~y$w_buff1~0_In-1870454983, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1870454983|, ~y~0=~y~0_In-1870454983, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1870454983|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870454983} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:09:28,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1514485732 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1514485732 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1514485732 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1514485732 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-1514485732| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out-1514485732| ~y$w_buff1_used~0_In-1514485732)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514485732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514485732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514485732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514485732} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514485732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514485732, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1514485732|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514485732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514485732} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:09:28,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-274925137 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-274925137 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-274925137 |P1Thread1of1ForFork2_#t~ite5_Out-274925137|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-274925137|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-274925137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-274925137} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-274925137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-274925137, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-274925137|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:09:28,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2068680619 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2068680619 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2068680619 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2068680619 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out-2068680619| ~y$w_buff1_used~0_In-2068680619) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite6_Out-2068680619| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2068680619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068680619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2068680619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068680619} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2068680619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068680619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2068680619, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-2068680619|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068680619} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:09:28,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1563238697 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1563238697 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1563238697 |P1Thread1of1ForFork2_#t~ite7_Out-1563238697|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1563238697|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563238697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563238697} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563238697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563238697, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1563238697|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:09:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In228880763 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In228880763 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In228880763 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In228880763 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In228880763 |P1Thread1of1ForFork2_#t~ite8_Out228880763|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out228880763|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In228880763, ~y$w_buff0_used~0=~y$w_buff0_used~0_In228880763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In228880763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228880763} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In228880763, ~y$w_buff0_used~0=~y$w_buff0_used~0_In228880763, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out228880763|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In228880763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228880763} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:09:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 15:09:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2024257757 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2024257757 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-2024257757 ~y$r_buff0_thd3~0_Out-2024257757) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out-2024257757) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024257757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2024257757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024257757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2024257757, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-2024257757|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:09:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-752303555 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-752303555 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-752303555 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-752303555 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out-752303555| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-752303555| ~y$r_buff1_thd3~0_In-752303555) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-752303555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752303555, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-752303555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752303555} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-752303555|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-752303555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752303555, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-752303555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752303555} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:09:28,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 15:09:28,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:09:28,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out2023365479| |ULTIMATE.start_main_#t~ite18_Out2023365479|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2023365479 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2023365479 256) 0))) (or (and (= ~y$w_buff1~0_In2023365479 |ULTIMATE.start_main_#t~ite18_Out2023365479|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out2023365479| ~y~0_In2023365479)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2023365479, ~y~0=~y~0_In2023365479, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2023365479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2023365479} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2023365479, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2023365479|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2023365479|, ~y~0=~y~0_In2023365479, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2023365479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2023365479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:28,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In361726493 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In361726493 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out361726493| ~y$w_buff0_used~0_In361726493)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out361726493| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In361726493, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In361726493} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In361726493, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In361726493, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out361726493|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:28,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1744225017 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1744225017 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1744225017 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1744225017 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1744225017| ~y$w_buff1_used~0_In-1744225017) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1744225017| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1744225017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1744225017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1744225017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1744225017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1744225017, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1744225017, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1744225017|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1744225017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1744225017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:28,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In513410014 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In513410014 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out513410014|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out513410014| ~y$r_buff0_thd0~0_In513410014)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In513410014, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513410014} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In513410014, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513410014, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out513410014|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:28,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-829724346 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-829724346 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-829724346 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-829724346 256)))) (or (and (= ~y$r_buff1_thd0~0_In-829724346 |ULTIMATE.start_main_#t~ite23_Out-829724346|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-829724346|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-829724346, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-829724346, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-829724346, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829724346} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-829724346, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-829724346, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-829724346, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-829724346|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829724346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:09:28,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-215165171 256) 0))) (or (and (= ~y$w_buff0~0_In-215165171 |ULTIMATE.start_main_#t~ite29_Out-215165171|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-215165171 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-215165171 256)) .cse0) (and (= (mod ~y$r_buff1_thd0~0_In-215165171 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-215165171 256) 0))) (= |ULTIMATE.start_main_#t~ite30_Out-215165171| |ULTIMATE.start_main_#t~ite29_Out-215165171|) .cse1) (and (= |ULTIMATE.start_main_#t~ite29_In-215165171| |ULTIMATE.start_main_#t~ite29_Out-215165171|) (= |ULTIMATE.start_main_#t~ite30_Out-215165171| ~y$w_buff0~0_In-215165171) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-215165171, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-215165171|, ~y$w_buff0~0=~y$w_buff0~0_In-215165171, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215165171, ~weak$$choice2~0=~weak$$choice2~0_In-215165171, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-215165171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-215165171} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-215165171|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-215165171, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-215165171|, ~y$w_buff0~0=~y$w_buff0~0_In-215165171, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215165171, ~weak$$choice2~0=~weak$$choice2~0_In-215165171, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-215165171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-215165171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 15:09:28,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In16867062 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In16867062 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In16867062 256)) (and (= 0 (mod ~y$w_buff1_used~0_In16867062 256)) .cse0) (and (= (mod ~y$r_buff1_thd0~0_In16867062 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite33_Out16867062| |ULTIMATE.start_main_#t~ite32_Out16867062|) (= |ULTIMATE.start_main_#t~ite32_Out16867062| ~y$w_buff1~0_In16867062) .cse1) (and (= |ULTIMATE.start_main_#t~ite32_In16867062| |ULTIMATE.start_main_#t~ite32_Out16867062|) (= |ULTIMATE.start_main_#t~ite33_Out16867062| ~y$w_buff1~0_In16867062) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In16867062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16867062, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16867062, ~weak$$choice2~0=~weak$$choice2~0_In16867062, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16867062, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In16867062|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16867062} OutVars{~y$w_buff1~0=~y$w_buff1~0_In16867062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16867062, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16867062, ~weak$$choice2~0=~weak$$choice2~0_In16867062, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out16867062|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16867062, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out16867062|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16867062} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 15:09:28,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1892332372 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1892332372 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-1892332372 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1892332372 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-1892332372 256) 0))) (= |ULTIMATE.start_main_#t~ite35_Out-1892332372| ~y$w_buff0_used~0_In-1892332372) (= |ULTIMATE.start_main_#t~ite36_Out-1892332372| |ULTIMATE.start_main_#t~ite35_Out-1892332372|) .cse1) (and (= |ULTIMATE.start_main_#t~ite36_Out-1892332372| ~y$w_buff0_used~0_In-1892332372) (= |ULTIMATE.start_main_#t~ite35_In-1892332372| |ULTIMATE.start_main_#t~ite35_Out-1892332372|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1892332372, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1892332372, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1892332372|, ~weak$$choice2~0=~weak$$choice2~0_In-1892332372, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1892332372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1892332372} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1892332372, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1892332372, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1892332372|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1892332372|, ~weak$$choice2~0=~weak$$choice2~0_In-1892332372, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1892332372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1892332372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 15:09:28,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 15:09:28,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:09:28,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:09:28,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:28 BasicIcfg [2019-12-18 15:09:28,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:28,875 INFO L168 Benchmark]: Toolchain (without parser) took 19320.19 ms. Allocated memory was 135.8 MB in the beginning and 839.9 MB in the end (delta: 704.1 MB). Free memory was 98.8 MB in the beginning and 289.9 MB in the end (delta: -191.1 MB). Peak memory consumption was 513.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,876 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.87 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.3 MB in the beginning and 153.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 199.8 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,879 INFO L168 Benchmark]: Boogie Preprocessor took 37.53 ms. Allocated memory is still 199.8 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,879 INFO L168 Benchmark]: RCFGBuilder took 802.58 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 102.1 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,880 INFO L168 Benchmark]: TraceAbstraction took 17608.14 ms. Allocated memory was 199.8 MB in the beginning and 839.9 MB in the end (delta: 640.2 MB). Free memory was 101.4 MB in the beginning and 289.9 MB in the end (delta: -188.5 MB). Peak memory consumption was 451.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:28,885 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.25 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.87 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.3 MB in the beginning and 153.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 199.8 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.53 ms. Allocated memory is still 199.8 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.58 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 102.1 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17608.14 ms. Allocated memory was 199.8 MB in the beginning and 839.9 MB in the end (delta: 640.2 MB). Free memory was 101.4 MB in the beginning and 289.9 MB in the end (delta: -188.5 MB). Peak memory consumption was 451.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L800] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L802] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L808] 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) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 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 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L819] 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}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L819] 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) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 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}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L823] 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)) [L825] 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)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1451 SDslu, 3523 SDs, 0 SdLazy, 1997 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 4474 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 608 ConstructedInterpolants, 0 QuantifiedInterpolants, 120200 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...