/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/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:25,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:25,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:25,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:25,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:25,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:25,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:25,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:25,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:25,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:25,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:25,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:25,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:25,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:25,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:25,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:25,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:25,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:25,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:25,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:25,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:25,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:25,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:25,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:25,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:25,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:25,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:25,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:25,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:25,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:25,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:25,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:25,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:25,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:25,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:25,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:25,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:25,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:25,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:25,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:25,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:25,263 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:25,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:25,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:25,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:25,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:25,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:25,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:25,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:25,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:25,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:25,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:25,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:25,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:25,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:25,282 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:25,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:25,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:25,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:25,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:25,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:25,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:25,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:25,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:25,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:25,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:25,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:25,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:25,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:25,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:25,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:25,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:25,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:25,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:25,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:25,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:25,611 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:25,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 15:09:25,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52286ad4b/144e4b79bc16428a826faaf6bc67b45d/FLAG25ae60622 [2019-12-18 15:09:26,187 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:26,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 15:09:26,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52286ad4b/144e4b79bc16428a826faaf6bc67b45d/FLAG25ae60622 [2019-12-18 15:09:26,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52286ad4b/144e4b79bc16428a826faaf6bc67b45d [2019-12-18 15:09:26,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:26,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:26,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:26,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:26,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:26,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:26" (1/1) ... [2019-12-18 15:09:26,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:26, skipping insertion in model container [2019-12-18 15:09:26,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:26" (1/1) ... [2019-12-18 15:09:26,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:26,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:27,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:27,321 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:27,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:27,485 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:27,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:27 WrapperNode [2019-12-18 15:09:27,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:27,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:27,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:27,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:27,495 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:27" (1/1) ... [2019-12-18 15:09:27,515 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:27" (1/1) ... [2019-12-18 15:09:27,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:27,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:27,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:27,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:27,573 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:27" (1/1) ... [2019-12-18 15:09:27,573 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:27" (1/1) ... [2019-12-18 15:09:27,577 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:27" (1/1) ... [2019-12-18 15:09:27,578 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:27" (1/1) ... [2019-12-18 15:09:27,588 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:27" (1/1) ... [2019-12-18 15:09:27,592 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:27" (1/1) ... [2019-12-18 15:09:27,595 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:27" (1/1) ... [2019-12-18 15:09:27,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:27,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:27,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:27,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:27,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:27" (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:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:27,684 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:28,453 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:28,453 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:28,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:28 BoogieIcfgContainer [2019-12-18 15:09:28,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:28,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:28,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:28,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:28,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:26" (1/3) ... [2019-12-18 15:09:28,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:28, skipping insertion in model container [2019-12-18 15:09:28,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:27" (2/3) ... [2019-12-18 15:09:28,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:28, skipping insertion in model container [2019-12-18 15:09:28,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:28" (3/3) ... [2019-12-18 15:09:28,464 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-18 15:09:28,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:28,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:28,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:28,483 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,531 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:28,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,543 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,543 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:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,544 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,544 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:28,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:28,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:28,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:28,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:28,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:28,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:28,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:28,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:28,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:28,606 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 15:09:28,608 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:28,734 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:28,734 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:28,751 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:28,770 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:28,840 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:28,840 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:28,848 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:28,863 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:28,864 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:33,497 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:09:33,611 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:09:33,634 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-18 15:09:33,635 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 15:09:33,638 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-18 15:09:34,532 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-18 15:09:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-18 15:09:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:09:34,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:34,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:34,541 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:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-18 15:09:34,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:34,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393387418] [2019-12-18 15:09:34,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:34,804 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:34,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393387418] [2019-12-18 15:09:34,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:34,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:34,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751904435] [2019-12-18 15:09:34,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:34,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:34,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:34,831 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-18 15:09:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:35,150 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-18 15:09:35,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:35,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:09:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:35,331 INFO L225 Difference]: With dead ends: 15638 [2019-12-18 15:09:35,332 INFO L226 Difference]: Without dead ends: 15326 [2019-12-18 15:09:35,334 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:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-18 15:09:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-18 15:09:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-18 15:09:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-18 15:09:36,620 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-18 15:09:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:36,621 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-18 15:09:36,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-18 15:09:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:36,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:36,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:36,626 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:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-18 15:09:36,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:36,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718603453] [2019-12-18 15:09:36,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:36,857 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:36,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718603453] [2019-12-18 15:09:36,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:36,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:36,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402897765] [2019-12-18 15:09:36,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:36,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:36,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:36,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:36,861 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-18 15:09:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:37,338 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-18 15:09:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:37,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:37,440 INFO L225 Difference]: With dead ends: 24490 [2019-12-18 15:09:37,440 INFO L226 Difference]: Without dead ends: 24476 [2019-12-18 15:09:37,441 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:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-18 15:09:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-18 15:09:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-18 15:09:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-18 15:09:38,434 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-18 15:09:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:38,434 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-18 15:09:38,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-18 15:09:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:38,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:38,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:38,439 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:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-18 15:09:38,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:38,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526009401] [2019-12-18 15:09:38,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:38,488 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:38,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526009401] [2019-12-18 15:09:38,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:38,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:38,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801575305] [2019-12-18 15:09:38,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:38,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:38,492 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-18 15:09:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:38,570 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-18 15:09:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:38,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:09:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:38,621 INFO L225 Difference]: With dead ends: 12702 [2019-12-18 15:09:38,621 INFO L226 Difference]: Without dead ends: 12702 [2019-12-18 15:09:38,622 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:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-18 15:09:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-18 15:09:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-18 15:09:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-18 15:09:39,849 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-18 15:09:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-18 15:09:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-18 15:09:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:09:39,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:39,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:39,852 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:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-18 15:09:39,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:39,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137338201] [2019-12-18 15:09:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:39,898 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:39,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137338201] [2019-12-18 15:09:39,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:39,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:39,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222579628] [2019-12-18 15:09:39,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:39,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:39,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:39,901 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-18 15:09:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:39,938 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-18 15:09:39,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:39,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:09:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:39,943 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 15:09:39,943 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 15:09:39,943 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:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 15:09:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 15:09:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 15:09:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-18 15:09:39,975 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-18 15:09:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:39,975 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-18 15:09:39,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-18 15:09:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:09:39,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:39,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:39,978 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:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-18 15:09:39,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:39,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641340961] [2019-12-18 15:09:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:40,123 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:40,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641340961] [2019-12-18 15:09:40,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:40,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:40,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734671504] [2019-12-18 15:09:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:40,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:40,127 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-18 15:09:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:40,151 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-18 15:09:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:40,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:09:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:40,153 INFO L225 Difference]: With dead ends: 630 [2019-12-18 15:09:40,153 INFO L226 Difference]: Without dead ends: 630 [2019-12-18 15:09:40,154 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:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-18 15:09:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-18 15:09:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-18 15:09:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-18 15:09:40,165 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-18 15:09:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:40,166 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-18 15:09:40,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-18 15:09:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:40,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:40,171 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:40,171 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:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-18 15:09:40,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:40,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37833150] [2019-12-18 15:09:40,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:40,268 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:40,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37833150] [2019-12-18 15:09:40,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:40,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:40,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518074072] [2019-12-18 15:09:40,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:40,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:40,271 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-18 15:09:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:40,316 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-18 15:09:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:40,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:40,318 INFO L225 Difference]: With dead ends: 584 [2019-12-18 15:09:40,318 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 15:09:40,319 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:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 15:09:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-18 15:09:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 15:09:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-18 15:09:40,328 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-18 15:09:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:40,329 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-18 15:09:40,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-18 15:09:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:40,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:40,331 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:40,331 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:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-18 15:09:40,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:40,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972130445] [2019-12-18 15:09:40,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:40,474 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:40,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972130445] [2019-12-18 15:09:40,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:40,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:40,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294031658] [2019-12-18 15:09:40,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:40,479 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 6 states. [2019-12-18 15:09:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:40,822 INFO L93 Difference]: Finished difference Result 933 states and 2172 transitions. [2019-12-18 15:09:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:09:40,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 15:09:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:40,825 INFO L225 Difference]: With dead ends: 933 [2019-12-18 15:09:40,826 INFO L226 Difference]: Without dead ends: 933 [2019-12-18 15:09:40,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:09:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-18 15:09:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 738. [2019-12-18 15:09:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 15:09:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1733 transitions. [2019-12-18 15:09:40,845 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1733 transitions. Word has length 55 [2019-12-18 15:09:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:40,845 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1733 transitions. [2019-12-18 15:09:40,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1733 transitions. [2019-12-18 15:09:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:40,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:40,848 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:40,848 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:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -256459022, now seen corresponding path program 2 times [2019-12-18 15:09:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:40,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347714775] [2019-12-18 15:09:40,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:41,017 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:41,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347714775] [2019-12-18 15:09:41,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:41,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:41,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796390665] [2019-12-18 15:09:41,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:41,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:41,023 INFO L87 Difference]: Start difference. First operand 738 states and 1733 transitions. Second operand 6 states. [2019-12-18 15:09:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:41,498 INFO L93 Difference]: Finished difference Result 1275 states and 2967 transitions. [2019-12-18 15:09:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:09:41,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 15:09:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:41,500 INFO L225 Difference]: With dead ends: 1275 [2019-12-18 15:09:41,500 INFO L226 Difference]: Without dead ends: 1275 [2019-12-18 15:09:41,501 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:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-18 15:09:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 816. [2019-12-18 15:09:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-18 15:09:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1930 transitions. [2019-12-18 15:09:41,518 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1930 transitions. Word has length 55 [2019-12-18 15:09:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:41,518 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1930 transitions. [2019-12-18 15:09:41,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1930 transitions. [2019-12-18 15:09:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:41,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:41,521 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:41,521 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:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -198491454, now seen corresponding path program 3 times [2019-12-18 15:09:41,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:41,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871343046] [2019-12-18 15:09:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:41,577 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:41,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871343046] [2019-12-18 15:09:41,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:41,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:41,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644771994] [2019-12-18 15:09:41,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:41,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:41,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:41,580 INFO L87 Difference]: Start difference. First operand 816 states and 1930 transitions. Second operand 3 states. [2019-12-18 15:09:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:41,595 INFO L93 Difference]: Finished difference Result 738 states and 1703 transitions. [2019-12-18 15:09:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:41,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:41,597 INFO L225 Difference]: With dead ends: 738 [2019-12-18 15:09:41,597 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 15:09:41,598 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:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 15:09:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-18 15:09:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 15:09:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1703 transitions. [2019-12-18 15:09:41,609 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1703 transitions. Word has length 55 [2019-12-18 15:09:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:41,609 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1703 transitions. [2019-12-18 15:09:41,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1703 transitions. [2019-12-18 15:09:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:41,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:41,611 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:41,612 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:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 1 times [2019-12-18 15:09:41,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:41,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240818809] [2019-12-18 15:09:41,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:41,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240818809] [2019-12-18 15:09:41,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:41,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:41,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129366132] [2019-12-18 15:09:41,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:41,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:41,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:41,677 INFO L87 Difference]: Start difference. First operand 738 states and 1703 transitions. Second operand 3 states. [2019-12-18 15:09:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:41,720 INFO L93 Difference]: Finished difference Result 738 states and 1702 transitions. [2019-12-18 15:09:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:41,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 15:09:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:41,722 INFO L225 Difference]: With dead ends: 738 [2019-12-18 15:09:41,722 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 15:09:41,723 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:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 15:09:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 475. [2019-12-18 15:09:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-18 15:09:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1091 transitions. [2019-12-18 15:09:41,732 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1091 transitions. Word has length 56 [2019-12-18 15:09:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:41,732 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1091 transitions. [2019-12-18 15:09:41,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1091 transitions. [2019-12-18 15:09:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:41,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:41,734 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, 1] [2019-12-18 15:09:41,735 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:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash 700007354, now seen corresponding path program 1 times [2019-12-18 15:09:41,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:41,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931124306] [2019-12-18 15:09:41,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:41,873 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:41,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931124306] [2019-12-18 15:09:41,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:41,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:41,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528808092] [2019-12-18 15:09:41,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:41,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:41,877 INFO L87 Difference]: Start difference. First operand 475 states and 1091 transitions. Second operand 6 states. [2019-12-18 15:09:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:41,957 INFO L93 Difference]: Finished difference Result 717 states and 1531 transitions. [2019-12-18 15:09:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:41,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 15:09:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:41,959 INFO L225 Difference]: With dead ends: 717 [2019-12-18 15:09:41,959 INFO L226 Difference]: Without dead ends: 446 [2019-12-18 15:09:41,960 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:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-18 15:09:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 413. [2019-12-18 15:09:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 15:09:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 912 transitions. [2019-12-18 15:09:41,967 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 912 transitions. Word has length 57 [2019-12-18 15:09:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:41,967 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 912 transitions. [2019-12-18 15:09:41,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 912 transitions. [2019-12-18 15:09:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:41,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:41,969 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, 1] [2019-12-18 15:09:41,969 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:41,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 2 times [2019-12-18 15:09:41,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:41,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911958141] [2019-12-18 15:09:41,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:42,127 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:42,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911958141] [2019-12-18 15:09:42,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:42,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:42,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834821342] [2019-12-18 15:09:42,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:42,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:42,130 INFO L87 Difference]: Start difference. First operand 413 states and 912 transitions. Second operand 6 states. [2019-12-18 15:09:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:42,215 INFO L93 Difference]: Finished difference Result 591 states and 1224 transitions. [2019-12-18 15:09:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:42,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 15:09:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:42,216 INFO L225 Difference]: With dead ends: 591 [2019-12-18 15:09:42,216 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 15:09:42,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 15:09:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-18 15:09:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 15:09:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-18 15:09:42,225 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 57 [2019-12-18 15:09:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:42,226 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-18 15:09:42,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-18 15:09:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:42,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:42,228 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, 1] [2019-12-18 15:09:42,228 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:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 3 times [2019-12-18 15:09:42,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:42,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625323800] [2019-12-18 15:09:42,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:42,551 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:42,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625323800] [2019-12-18 15:09:42,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:42,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:09:42,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569929760] [2019-12-18 15:09:42,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:09:42,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:09:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:09:42,554 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 12 states. [2019-12-18 15:09:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:43,028 INFO L93 Difference]: Finished difference Result 376 states and 640 transitions. [2019-12-18 15:09:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:09:43,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 15:09:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:43,030 INFO L225 Difference]: With dead ends: 376 [2019-12-18 15:09:43,030 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 15:09:43,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:09:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 15:09:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-18 15:09:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 15:09:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-18 15:09:43,041 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 57 [2019-12-18 15:09:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:43,043 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-18 15:09:43,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:09:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-18 15:09:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:43,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:43,046 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, 1] [2019-12-18 15:09:43,046 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:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 4 times [2019-12-18 15:09:43,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:43,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457919166] [2019-12-18 15:09:43,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:43,822 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:43,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457919166] [2019-12-18 15:09:43,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:43,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:09:43,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57792898] [2019-12-18 15:09:43,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:09:43,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:09:43,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:09:43,824 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 20 states. [2019-12-18 15:09:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:45,142 INFO L93 Difference]: Finished difference Result 729 states and 1244 transitions. [2019-12-18 15:09:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:09:45,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-18 15:09:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:45,144 INFO L225 Difference]: With dead ends: 729 [2019-12-18 15:09:45,144 INFO L226 Difference]: Without dead ends: 696 [2019-12-18 15:09:45,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:09:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-18 15:09:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 325. [2019-12-18 15:09:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-18 15:09:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 567 transitions. [2019-12-18 15:09:45,153 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 567 transitions. Word has length 57 [2019-12-18 15:09:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:45,153 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 567 transitions. [2019-12-18 15:09:45,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:09:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 567 transitions. [2019-12-18 15:09:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:45,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:45,155 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, 1] [2019-12-18 15:09:45,155 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:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1227312486, now seen corresponding path program 5 times [2019-12-18 15:09:45,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:45,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877346450] [2019-12-18 15:09:45,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:45,343 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:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877346450] [2019-12-18 15:09:45,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:45,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338576835] [2019-12-18 15:09:45,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:45,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:45,345 INFO L87 Difference]: Start difference. First operand 325 states and 567 transitions. Second operand 13 states. [2019-12-18 15:09:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:45,648 INFO L93 Difference]: Finished difference Result 428 states and 722 transitions. [2019-12-18 15:09:45,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:09:45,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 15:09:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:45,649 INFO L225 Difference]: With dead ends: 428 [2019-12-18 15:09:45,650 INFO L226 Difference]: Without dead ends: 395 [2019-12-18 15:09:45,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:09:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-18 15:09:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 317. [2019-12-18 15:09:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 15:09:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-18 15:09:45,660 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 57 [2019-12-18 15:09:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:45,661 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-18 15:09:45,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-18 15:09:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:45,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:45,662 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, 1] [2019-12-18 15:09:45,662 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:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 6 times [2019-12-18 15:09:45,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:45,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828928668] [2019-12-18 15:09:45,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:45,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:45,809 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:45,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$w_buff0~0_215) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~main$tmp_guard0~0_26 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~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_#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, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2516~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, 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_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~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, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:45,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 15:09:45,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-18 15:09:45,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} 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:45,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:09:45,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1118954900 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1118954900 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1118954900 |P2Thread1of1ForFork0_#t~ite11_Out-1118954900|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1118954900|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1118954900, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1118954900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1118954900, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1118954900|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1118954900} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:09:45,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-1235968731| |P1Thread1of1ForFork2_#t~ite3_Out-1235968731|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1235968731 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1235968731 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-1235968731 |P1Thread1of1ForFork2_#t~ite3_Out-1235968731|)) (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1235968731 |P1Thread1of1ForFork2_#t~ite3_Out-1235968731|) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1235968731, ~y$w_buff1~0=~y$w_buff1~0_In-1235968731, ~y~0=~y~0_In-1235968731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1235968731} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1235968731, ~y$w_buff1~0=~y$w_buff1~0_In-1235968731, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1235968731|, ~y~0=~y~0_In-1235968731, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1235968731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1235968731} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:09:45,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2068028392 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2068028392 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out2068028392|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In2068028392 |P1Thread1of1ForFork2_#t~ite5_Out2068028392|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2068028392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2068028392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2068028392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2068028392, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out2068028392|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:09:45,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In915759473 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In915759473 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In915759473 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In915759473 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out915759473| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite12_Out915759473| ~y$w_buff1_used~0_In915759473) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In915759473, ~y$w_buff0_used~0=~y$w_buff0_used~0_In915759473, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In915759473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In915759473} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In915759473, ~y$w_buff0_used~0=~y$w_buff0_used~0_In915759473, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out915759473|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In915759473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In915759473} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:09:45,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In424919007 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In424919007 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In424919007 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In424919007 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out424919007| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite6_Out424919007| ~y$w_buff1_used~0_In424919007) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In424919007, ~y$w_buff0_used~0=~y$w_buff0_used~0_In424919007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In424919007, ~y$w_buff1_used~0=~y$w_buff1_used~0_In424919007} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In424919007, ~y$w_buff0_used~0=~y$w_buff0_used~0_In424919007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In424919007, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out424919007|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In424919007} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:09:45,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1790235750 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1790235750 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out1790235750| ~y$r_buff0_thd2~0_In1790235750) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1790235750| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1790235750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1790235750} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1790235750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1790235750, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1790235750|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:09:45,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In114586787 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In114586787 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In114586787 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In114586787 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out114586787|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In114586787 |P1Thread1of1ForFork2_#t~ite8_Out114586787|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In114586787, ~y$w_buff0_used~0=~y$w_buff0_used~0_In114586787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In114586787, ~y$w_buff1_used~0=~y$w_buff1_used~0_In114586787} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In114586787, ~y$w_buff0_used~0=~y$w_buff0_used~0_In114586787, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out114586787|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In114586787, ~y$w_buff1_used~0=~y$w_buff1_used~0_In114586787} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:09:45,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, 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:45,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1844581194 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1844581194 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-1844581194 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1844581194 ~y$r_buff0_thd3~0_Out-1844581194) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844581194, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1844581194} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844581194, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1844581194, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1844581194|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:09:45,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1923532022 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1923532022 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1923532022 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1923532022 256)))) (or (and (= ~y$r_buff1_thd3~0_In-1923532022 |P2Thread1of1ForFork0_#t~ite14_Out-1923532022|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1923532022|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1923532022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923532022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1923532022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1923532022} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1923532022|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1923532022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923532022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1923532022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1923532022} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:09:45,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, 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:45,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~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:45,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-671459282 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-671459282 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-671459282| |ULTIMATE.start_main_#t~ite19_Out-671459282|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-671459282| ~y~0_In-671459282)) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-671459282| ~y$w_buff1~0_In-671459282)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-671459282, ~y~0=~y~0_In-671459282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-671459282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-671459282} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-671459282, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-671459282|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-671459282|, ~y~0=~y~0_In-671459282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-671459282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-671459282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:45,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1123886033 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1123886033 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1123886033| ~y$w_buff0_used~0_In1123886033) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1123886033| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1123886033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1123886033} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1123886033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1123886033, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1123886033|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:45,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-641150474 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-641150474 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-641150474 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-641150474 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-641150474| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-641150474 |ULTIMATE.start_main_#t~ite21_Out-641150474|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-641150474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-641150474, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641150474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641150474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-641150474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-641150474, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-641150474|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641150474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641150474} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:45,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-746962730 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-746962730 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-746962730| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-746962730| ~y$r_buff0_thd0~0_In-746962730)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-746962730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746962730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-746962730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-746962730, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-746962730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:45,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In300230147 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In300230147 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In300230147 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In300230147 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out300230147| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite23_Out300230147| ~y$r_buff1_thd0~0_In300230147)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In300230147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In300230147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In300230147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300230147} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In300230147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In300230147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In300230147, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out300230147|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300230147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:09:45,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1760149556 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-1760149556| ~y$w_buff1_used~0_In-1760149556) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1760149556 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1760149556 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1760149556 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1760149556 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1760149556| |ULTIMATE.start_main_#t~ite38_Out-1760149556|)) (and (= |ULTIMATE.start_main_#t~ite38_In-1760149556| |ULTIMATE.start_main_#t~ite38_Out-1760149556|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1760149556| ~y$w_buff1_used~0_In-1760149556)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1760149556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1760149556, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1760149556|, ~weak$$choice2~0=~weak$$choice2~0_In-1760149556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1760149556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1760149556} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1760149556, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1760149556|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1760149556, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1760149556|, ~weak$$choice2~0=~weak$$choice2~0_In-1760149556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1760149556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1760149556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 15:09:45,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 15:09:45,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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:45,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->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:45,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:45 BasicIcfg [2019-12-18 15:09:45,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:45,961 INFO L168 Benchmark]: Toolchain (without parser) took 19435.69 ms. Allocated memory was 142.1 MB in the beginning and 827.3 MB in the end (delta: 685.2 MB). Free memory was 98.4 MB in the beginning and 287.8 MB in the end (delta: -189.4 MB). Peak memory consumption was 495.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,961 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 959.53 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.2 MB in the beginning and 153.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 199.8 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,968 INFO L168 Benchmark]: Boogie Preprocessor took 37.78 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,970 INFO L168 Benchmark]: RCFGBuilder took 854.15 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 100.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,971 INFO L168 Benchmark]: TraceAbstraction took 17501.54 ms. Allocated memory was 199.8 MB in the beginning and 827.3 MB in the end (delta: 627.6 MB). Free memory was 100.8 MB in the beginning and 287.8 MB in the end (delta: -187.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:45,976 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.22 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 959.53 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.2 MB in the beginning and 153.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 199.8 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.78 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 148.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.15 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 100.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17501.54 ms. Allocated memory was 199.8 MB in the beginning and 827.3 MB in the end (delta: 627.6 MB). Free memory was 100.8 MB in the beginning and 287.8 MB in the end (delta: -187.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L779] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L779] 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) [L750] 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, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 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) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 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 [L812] 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, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L812] 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) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 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 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] 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, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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 = !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) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L824] 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)) [L825] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L825] 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)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L826] 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)) [L827] 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)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L829] 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)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1524 SDtfs, 1416 SDslu, 4232 SDs, 0 SdLazy, 2379 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred 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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3763 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 132979 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...