/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:49:07,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:49:07,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:49:07,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:49:07,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:49:07,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:49:07,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:49:07,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:49:07,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:49:07,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:49:07,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:49:07,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:49:07,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:49:07,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:49:07,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:49:07,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:49:07,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:49:07,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:49:07,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:49:07,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:49:07,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:49:07,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:49:07,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:49:07,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:49:07,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:49:07,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:49:07,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:49:07,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:49:07,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:49:07,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:49:07,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:49:07,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:49:07,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:49:07,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:49:07,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:49:07,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:49:07,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:49:07,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:49:07,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:49:07,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:49:07,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:49:07,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:49:07,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:49:07,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:49:07,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:49:07,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:49:07,395 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:49:07,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:49:07,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:49:07,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:49:07,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:49:07,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:49:07,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:49:07,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:49:07,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:49:07,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:49:07,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:49:07,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:49:07,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:49:07,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:49:07,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:49:07,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:49:07,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:49:07,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:49:07,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:49:07,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:49:07,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:49:07,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:49:07,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:49:07,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:49:07,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:49:07,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:49:07,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:49:07,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:49:07,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:49:07,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:49:07,694 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:49:07,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-18 21:49:07,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44635600b/95a2ce00c3cd460aba959c733ec35dac/FLAG43a95f72c [2019-12-18 21:49:08,304 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:49:08,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-18 21:49:08,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44635600b/95a2ce00c3cd460aba959c733ec35dac/FLAG43a95f72c [2019-12-18 21:49:08,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44635600b/95a2ce00c3cd460aba959c733ec35dac [2019-12-18 21:49:08,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:49:08,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:49:08,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:08,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:49:08,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:49:08,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:08" (1/1) ... [2019-12-18 21:49:08,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7100f718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:08, skipping insertion in model container [2019-12-18 21:49:08,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:08" (1/1) ... [2019-12-18 21:49:08,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:49:08,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:49:09,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:09,229 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:49:09,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:09,372 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:49:09,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09 WrapperNode [2019-12-18 21:49:09,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:09,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:09,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:49:09,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:49:09,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:09,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:49:09,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:49:09,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:49:09,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (1/1) ... [2019-12-18 21:49:09,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:49:09,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:49:09,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:49:09,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:49:09,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (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 21:49:09,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:49:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:49:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:49:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:49:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:49:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:49:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:49:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:49:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:49:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:49:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:49:09,555 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 21:49:10,182 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:49:10,182 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:49:10,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:10 BoogieIcfgContainer [2019-12-18 21:49:10,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:49:10,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:49:10,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:49:10,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:49:10,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:49:08" (1/3) ... [2019-12-18 21:49:10,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577ce386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:10, skipping insertion in model container [2019-12-18 21:49:10,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:09" (2/3) ... [2019-12-18 21:49:10,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577ce386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:10, skipping insertion in model container [2019-12-18 21:49:10,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:10" (3/3) ... [2019-12-18 21:49:10,192 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2019-12-18 21:49:10,203 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:49:10,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:49:10,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:49:10,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:49:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,274 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:10,297 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:49:10,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:49:10,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:49:10,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:49:10,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:49:10,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:49:10,320 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:49:10,320 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:49:10,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:49:10,338 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 21:49:10,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:49:10,438 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:49:10,439 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:10,456 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:49:10,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:49:10,513 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:49:10,514 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:10,520 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:49:10,533 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:49:10,535 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:49:13,399 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 21:49:13,523 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 21:49:13,544 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-18 21:49:13,544 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 21:49:13,548 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-18 21:49:14,047 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-18 21:49:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-18 21:49:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:49:14,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:14,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:49:14,058 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-18 21:49:14,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:14,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210583807] [2019-12-18 21:49:14,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:14,282 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 21:49:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210583807] [2019-12-18 21:49:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:49:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784801427] [2019-12-18 21:49:14,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:14,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:14,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:14,309 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-18 21:49:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:14,557 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-18 21:49:14,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:14,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:49:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:14,656 INFO L225 Difference]: With dead ends: 9108 [2019-12-18 21:49:14,657 INFO L226 Difference]: Without dead ends: 8926 [2019-12-18 21:49:14,658 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 21:49:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-18 21:49:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-18 21:49:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-18 21:49:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-18 21:49:15,187 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-18 21:49:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:15,187 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-18 21:49:15,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-18 21:49:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:49:15,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:15,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:15,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-18 21:49:15,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:15,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669747065] [2019-12-18 21:49:15,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:15,293 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 21:49:15,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669747065] [2019-12-18 21:49:15,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:15,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:15,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896700725] [2019-12-18 21:49:15,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:15,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:15,296 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-18 21:49:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:15,335 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-18 21:49:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:15,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:49:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:15,345 INFO L225 Difference]: With dead ends: 1402 [2019-12-18 21:49:15,345 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 21:49:15,347 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 21:49:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 21:49:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-18 21:49:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-18 21:49:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-18 21:49:15,381 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-18 21:49:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:15,381 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-18 21:49:15,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-18 21:49:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:49:15,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:15,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:15,384 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-18 21:49:15,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:15,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4728740] [2019-12-18 21:49:15,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:15,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 21:49:15,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4728740] [2019-12-18 21:49:15,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:15,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:15,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452143912] [2019-12-18 21:49:15,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:15,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:15,476 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 4 states. [2019-12-18 21:49:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:15,767 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-18 21:49:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:15,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:49:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:15,780 INFO L225 Difference]: With dead ends: 1878 [2019-12-18 21:49:15,780 INFO L226 Difference]: Without dead ends: 1878 [2019-12-18 21:49:15,780 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 21:49:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-18 21:49:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-18 21:49:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-18 21:49:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-18 21:49:15,868 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-18 21:49:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:15,868 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-18 21:49:15,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-18 21:49:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:49:15,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:15,871 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] [2019-12-18 21:49:15,872 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-18 21:49:15,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:15,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821261300] [2019-12-18 21:49:15,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:15,969 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 21:49:15,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821261300] [2019-12-18 21:49:15,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:15,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:15,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777681465] [2019-12-18 21:49:15,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:15,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:15,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:15,971 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 4 states. [2019-12-18 21:49:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:15,998 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-18 21:49:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:49:15,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 21:49:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:16,001 INFO L225 Difference]: With dead ends: 357 [2019-12-18 21:49:16,002 INFO L226 Difference]: Without dead ends: 357 [2019-12-18 21:49:16,002 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 21:49:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-18 21:49:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-18 21:49:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:49:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-18 21:49:16,009 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-18 21:49:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:16,010 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-18 21:49:16,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-18 21:49:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:16,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:16,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:16,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-18 21:49:16,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:16,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248121853] [2019-12-18 21:49:16,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:16,129 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 21:49:16,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248121853] [2019-12-18 21:49:16,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:16,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:16,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693477696] [2019-12-18 21:49:16,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:16,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:16,132 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-18 21:49:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:16,187 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-18 21:49:16,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:16,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:16,190 INFO L225 Difference]: With dead ends: 332 [2019-12-18 21:49:16,190 INFO L226 Difference]: Without dead ends: 332 [2019-12-18 21:49:16,191 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 21:49:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-18 21:49:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-18 21:49:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 21:49:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-18 21:49:16,198 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-18 21:49:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:16,200 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-18 21:49:16,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-18 21:49:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:16,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:16,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:16,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-18 21:49:16,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:16,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113458130] [2019-12-18 21:49:16,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:16,306 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 21:49:16,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113458130] [2019-12-18 21:49:16,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:16,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:16,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129804378] [2019-12-18 21:49:16,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:16,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:16,309 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-18 21:49:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:16,544 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-18 21:49:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:49:16,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 21:49:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:16,547 INFO L225 Difference]: With dead ends: 459 [2019-12-18 21:49:16,547 INFO L226 Difference]: Without dead ends: 459 [2019-12-18 21:49:16,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:49:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-18 21:49:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-18 21:49:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-18 21:49:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-18 21:49:16,556 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-18 21:49:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:16,556 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-18 21:49:16,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-18 21:49:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:16,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:16,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:16,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-18 21:49:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:16,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832513058] [2019-12-18 21:49:16,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:16,671 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 21:49:16,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832513058] [2019-12-18 21:49:16,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:16,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:16,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465353347] [2019-12-18 21:49:16,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:16,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:16,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:16,674 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 3 states. [2019-12-18 21:49:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:16,691 INFO L93 Difference]: Finished difference Result 375 states and 683 transitions. [2019-12-18 21:49:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:16,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:16,698 INFO L225 Difference]: With dead ends: 375 [2019-12-18 21:49:16,698 INFO L226 Difference]: Without dead ends: 375 [2019-12-18 21:49:16,698 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 21:49:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-18 21:49:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-18 21:49:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-18 21:49:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-18 21:49:16,708 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-18 21:49:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:16,709 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-18 21:49:16,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-18 21:49:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:49:16,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:16,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:16,711 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-18 21:49:16,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:16,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349634826] [2019-12-18 21:49:16,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:16,823 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 21:49:16,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349634826] [2019-12-18 21:49:16,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:16,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104924547] [2019-12-18 21:49:16,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:16,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:16,825 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-18 21:49:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:16,881 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-18 21:49:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:16,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:49:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:16,883 INFO L225 Difference]: With dead ends: 363 [2019-12-18 21:49:16,883 INFO L226 Difference]: Without dead ends: 363 [2019-12-18 21:49:16,883 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 21:49:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-18 21:49:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-18 21:49:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-18 21:49:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-18 21:49:16,889 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-18 21:49:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:16,890 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-18 21:49:16,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-18 21:49:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:16,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:16,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:16,891 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-18 21:49:16,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:16,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713796340] [2019-12-18 21:49:16,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:17,024 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 21:49:17,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713796340] [2019-12-18 21:49:17,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:17,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:17,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595144357] [2019-12-18 21:49:17,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:17,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:17,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:17,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:17,027 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 7 states. [2019-12-18 21:49:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:17,139 INFO L93 Difference]: Finished difference Result 489 states and 885 transitions. [2019-12-18 21:49:17,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:49:17,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 21:49:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:17,141 INFO L225 Difference]: With dead ends: 489 [2019-12-18 21:49:17,141 INFO L226 Difference]: Without dead ends: 234 [2019-12-18 21:49:17,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:49:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-18 21:49:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-18 21:49:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-18 21:49:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-18 21:49:17,152 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-18 21:49:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:17,153 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-18 21:49:17,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-18 21:49:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:17,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:17,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:17,154 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-18 21:49:17,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:17,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120576408] [2019-12-18 21:49:17,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:17,472 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 21:49:17,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120576408] [2019-12-18 21:49:17,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:17,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:49:17,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869079394] [2019-12-18 21:49:17,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:49:17,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:49:17,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:49:17,473 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 14 states. [2019-12-18 21:49:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:18,044 INFO L93 Difference]: Finished difference Result 378 states and 653 transitions. [2019-12-18 21:49:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:49:18,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 21:49:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:18,047 INFO L225 Difference]: With dead ends: 378 [2019-12-18 21:49:18,047 INFO L226 Difference]: Without dead ends: 344 [2019-12-18 21:49:18,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:49:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-18 21:49:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2019-12-18 21:49:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-18 21:49:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 543 transitions. [2019-12-18 21:49:18,055 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 543 transitions. Word has length 54 [2019-12-18 21:49:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:18,056 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 543 transitions. [2019-12-18 21:49:18,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:49:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 543 transitions. [2019-12-18 21:49:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:18,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:18,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:18,057 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-18 21:49:18,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:18,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614517570] [2019-12-18 21:49:18,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:18,609 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 21:49:18,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614517570] [2019-12-18 21:49:18,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:18,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:49:18,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140597082] [2019-12-18 21:49:18,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:49:18,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:49:18,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:49:18,611 INFO L87 Difference]: Start difference. First operand 310 states and 543 transitions. Second operand 18 states. [2019-12-18 21:49:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:19,928 INFO L93 Difference]: Finished difference Result 767 states and 1318 transitions. [2019-12-18 21:49:19,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:49:19,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 21:49:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:19,933 INFO L225 Difference]: With dead ends: 767 [2019-12-18 21:49:19,933 INFO L226 Difference]: Without dead ends: 733 [2019-12-18 21:49:19,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:49:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-18 21:49:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 329. [2019-12-18 21:49:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 21:49:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2019-12-18 21:49:19,944 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 54 [2019-12-18 21:49:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:19,945 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2019-12-18 21:49:19,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:49:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-18 21:49:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:19,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:19,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:19,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2083989660, now seen corresponding path program 4 times [2019-12-18 21:49:19,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:19,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572420123] [2019-12-18 21:49:19,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:20,342 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 21:49:20,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572420123] [2019-12-18 21:49:20,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:20,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:49:20,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530585763] [2019-12-18 21:49:20,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:49:20,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:49:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:49:20,344 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand 14 states. [2019-12-18 21:49:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:21,059 INFO L93 Difference]: Finished difference Result 433 states and 740 transitions. [2019-12-18 21:49:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:49:21,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 21:49:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:21,062 INFO L225 Difference]: With dead ends: 433 [2019-12-18 21:49:21,062 INFO L226 Difference]: Without dead ends: 399 [2019-12-18 21:49:21,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:49:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-12-18 21:49:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 318. [2019-12-18 21:49:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-18 21:49:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-18 21:49:21,070 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-18 21:49:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:21,071 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-18 21:49:21,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:49:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-18 21:49:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:21,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:21,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:21,072 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 5 times [2019-12-18 21:49:21,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:21,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190328258] [2019-12-18 21:49:21,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:21,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:49:21,280 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:49:21,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1451~0.base_22| 4)) (= |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= v_~x$flush_delayed~0_16 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22| 1)) (= 0 v_~weak$$choice0~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22|) 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t1451~0.base=|v_ULTIMATE.start_main_~#t1451~0.base_22|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_~#t1451~0.offset=|v_ULTIMATE.start_main_~#t1451~0.offset_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1452~0.base, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t1451~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1452~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1451~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:49:21,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1452~0.base_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1452~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1452~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10|) |v_ULTIMATE.start_main_~#t1452~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1452~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10| 1)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_9|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1452~0.offset, ULTIMATE.start_main_~#t1452~0.base] because there is no mapped edge [2019-12-18 21:49:21,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:49:21,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In252359208 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out252359208| |P0Thread1of1ForFork0_#t~ite3_Out252359208|)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In252359208 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out252359208| ~x~0_In252359208) .cse0 (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In252359208 |P0Thread1of1ForFork0_#t~ite3_Out252359208|) (not .cse1) .cse0 (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In252359208, ~x$w_buff1_used~0=~x$w_buff1_used~0_In252359208, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In252359208, ~x~0=~x~0_In252359208} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out252359208|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out252359208|, ~x$w_buff1~0=~x$w_buff1~0_In252359208, ~x$w_buff1_used~0=~x$w_buff1_used~0_In252359208, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In252359208, ~x~0=~x~0_In252359208} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:49:21,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-479061962 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-479061962 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-479061962|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-479061962 |P0Thread1of1ForFork0_#t~ite5_Out-479061962|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-479061962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479061962} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-479061962|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-479061962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479061962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:49:21,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1053304352 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1053304352 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1053304352 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1053304352 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1053304352|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1053304352 |P0Thread1of1ForFork0_#t~ite6_Out-1053304352|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1053304352, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1053304352, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1053304352, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1053304352} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1053304352|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1053304352, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1053304352, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1053304352, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1053304352} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:49:21,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1241481718 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1241481718 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1241481718|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1241481718 |P1Thread1of1ForFork1_#t~ite11_Out1241481718|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1241481718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1241481718} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1241481718|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1241481718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1241481718} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:49:21,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1478261870 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1478261870 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1478261870|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In1478261870 |P0Thread1of1ForFork0_#t~ite7_Out1478261870|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1478261870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1478261870} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1478261870, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1478261870|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1478261870} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:49:21,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In454833626 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In454833626 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In454833626 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In454833626 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In454833626 |P0Thread1of1ForFork0_#t~ite8_Out454833626|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out454833626|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In454833626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In454833626, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In454833626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In454833626} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In454833626, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out454833626|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In454833626, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In454833626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In454833626} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:49:21,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:49:21,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1905747742 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1905747742 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1905747742 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1905747742 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1905747742| ~x$w_buff1_used~0_In-1905747742) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1905747742| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905747742, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1905747742, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1905747742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905747742} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905747742, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1905747742, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1905747742|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1905747742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905747742} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:49:21,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-84326981 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-84326981 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-84326981 ~x$r_buff0_thd2~0_In-84326981) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-84326981 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-84326981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-84326981} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-84326981|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-84326981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-84326981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:49:21,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-470063926 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-470063926 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-470063926 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-470063926 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-470063926| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-470063926| ~x$r_buff1_thd2~0_In-470063926) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-470063926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-470063926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-470063926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-470063926} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-470063926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-470063926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-470063926, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-470063926|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-470063926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:49:21,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:49:21,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:49:21,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-540755318 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-540755318| |ULTIMATE.start_main_#t~ite17_Out-540755318|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-540755318 256) 0))) (or (and .cse0 (= ~x~0_In-540755318 |ULTIMATE.start_main_#t~ite17_Out-540755318|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite17_Out-540755318| ~x$w_buff1~0_In-540755318)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-540755318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-540755318, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-540755318, ~x~0=~x~0_In-540755318} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-540755318|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-540755318|, ~x$w_buff1~0=~x$w_buff1~0_In-540755318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-540755318, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-540755318, ~x~0=~x~0_In-540755318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 21:49:21,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In926015164 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In926015164 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out926015164|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In926015164 |ULTIMATE.start_main_#t~ite19_Out926015164|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In926015164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In926015164} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In926015164, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out926015164|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In926015164} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:49:21,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1043227103 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1043227103 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1043227103 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1043227103 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1043227103|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1043227103 |ULTIMATE.start_main_#t~ite20_Out-1043227103|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1043227103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043227103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1043227103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1043227103} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1043227103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043227103, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1043227103|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1043227103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1043227103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:49:21,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-431540480 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-431540480 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-431540480| ~x$r_buff0_thd0~0_In-431540480) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-431540480|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-431540480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431540480} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-431540480, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-431540480|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-431540480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:49:21,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-970805939 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-970805939 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-970805939 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-970805939 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-970805939| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-970805939 |ULTIMATE.start_main_#t~ite22_Out-970805939|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-970805939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-970805939, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-970805939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-970805939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-970805939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-970805939, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-970805939, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-970805939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-970805939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:49:21,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1305546688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out1305546688| ~x$w_buff1~0_In1305546688) (= |ULTIMATE.start_main_#t~ite31_In1305546688| |ULTIMATE.start_main_#t~ite31_Out1305546688|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite31_Out1305546688| |ULTIMATE.start_main_#t~ite32_Out1305546688|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1305546688 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1305546688 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1305546688 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1305546688 256) 0)))) .cse0 (= |ULTIMATE.start_main_#t~ite31_Out1305546688| ~x$w_buff1~0_In1305546688)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1305546688, ~x$w_buff1~0=~x$w_buff1~0_In1305546688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1305546688, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1305546688, ~weak$$choice2~0=~weak$$choice2~0_In1305546688, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1305546688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1305546688} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1305546688, ~x$w_buff1~0=~x$w_buff1~0_In1305546688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1305546688, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1305546688|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1305546688, ~weak$$choice2~0=~weak$$choice2~0_In1305546688, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1305546688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1305546688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 21:49:21,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:49:21,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:49:21,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:49:21,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:49:21 BasicIcfg [2019-12-18 21:49:21,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:49:21,437 INFO L168 Benchmark]: Toolchain (without parser) took 12865.20 ms. Allocated memory was 136.8 MB in the beginning and 412.1 MB in the end (delta: 275.3 MB). Free memory was 99.1 MB in the beginning and 318.2 MB in the end (delta: -219.1 MB). Peak memory consumption was 319.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,438 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.19 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 98.9 MB in the beginning and 154.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,442 INFO L168 Benchmark]: Boogie Preprocessor took 38.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,446 INFO L168 Benchmark]: RCFGBuilder took 695.59 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 105.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,446 INFO L168 Benchmark]: TraceAbstraction took 11247.78 ms. Allocated memory was 201.3 MB in the beginning and 412.1 MB in the end (delta: 210.8 MB). Free memory was 105.3 MB in the beginning and 318.2 MB in the end (delta: -212.8 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:21,455 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 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.19 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 98.9 MB in the beginning and 154.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 695.59 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 105.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11247.78 ms. Allocated memory was 201.3 MB in the beginning and 412.1 MB in the end (delta: 210.8 MB). Free memory was 105.3 MB in the beginning and 318.2 MB in the end (delta: -212.8 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1164 SDtfs, 1387 SDslu, 3038 SDs, 0 SdLazy, 2171 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 919 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 110518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...